Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    Journal of agricultural and food chemistry 32 (1984), S. 288-292 
    ISSN: 1520-5118
    Source: ACS Legacy Archives
    Topics: Agriculture, Forestry, Horticulture, Fishery, Domestic Science, Nutrition , Process Engineering, Biotechnology, Nutrition Technology
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Machine vision and applications 10 (1997), S. 201-213 
    ISSN: 1432-1769
    Keywords: Key words: Stereoscopic vision – Stereo correspondence – Surface reconstruction – Depth computation – Stereo disparity
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract. We present a scheme for reliable and accurate surface reconstruction from stereoscopic images containing only fine texture and no stable high-level features. Partial shape information is used to improve surface computation: first by fitting an approximate, global, parametric model, and then by refining this model via local correspondence processes. This scheme eliminates the window size selection problem in existing area-based stereo correspondence schemes. These ideas are integrated in a practical vision system that is being used by environmental scientists to study wind erosion of bulk material such as coal ore being transported in open rail cars.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 144 (1975), S. 289-297 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 156 (1977), S. 13-18 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematische Zeitschrift 146 (1976), S. 291-292 
    ISSN: 1432-1823
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerische Mathematik 52 (1988), S. 365-375 
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F15 ; CR: G1.3
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary For each λ in some domainD in the complex plane, letF(λ) be a linear, compact operator on a Banach spaceX and letF be holomorphic in λ. Assuming that there is a ξ so thatI−F(ξ) is not one-to-one, we examine two local methods for approximating the nonlinear eigenvalue ξ. In the Newton method the smallest eigenvalue of the operator pencil [I−F(λ),F′(λ)] is used as increment. We show that under suitable hypotheses the sequence of Newton iterates is locally, quadratically convergent. Second, suppose 0 is an eigenvalue of the operator pencil [I−F(ξ),I] with algebraic multiplicitym. For fixed λ leth(λ) denote the arithmetic mean of them eigenvalues of the pencil [I−F(λ),I] which are closest to 0. Thenh is holomorphic in a neighborhood of ξ andh(ξ)=0. Under suitable hypotheses the classical Muller's method applied toh converges locally with order approximately 1.84.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    s.l. : American Chemical Society
    The @journal of physical chemistry 〈Washington, DC〉 79 (1975), S. 2609-2621 
    Source: ACS Legacy Archives
    Topics: Chemistry and Pharmacology , Physics
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    The journal of supercomputing 6 (1992), S. 315-329 
    ISSN: 1573-0484
    Keywords: Parallel Cholesky factorization ; BLAS ; parallel algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper considers four parallel Cholesky factorization algorithms, including SPOTRF from the February 1992 release of LAPACK, each of which call parallel Level 2 or 3 BLAS, or both. A fifth parallel Cholesky algorithm that calls serial Level 3 BLAS is also described. The efficiency of these five algorithms on the CRAY-2, CRAY Y-MP/832, Hitachi Data Systems EX 80, and IBM 3090-600J is evaluated and compared with a vendor-optimized parallel Cholesky factorization algorithm. The fifth parallel Cholesky algorithm that calls serial Level 3 BLAS provided the best performance of all algorithms that called BLAS routines. In fact, this algorithm outperformed the Cray-optimized libsci routine (SPOTRF) by 13–44%;, depending on the problem size and the number of processors used.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Constructive approximation 2 (1986), S. 129-151 
    ISSN: 1432-0940
    Keywords: 41A05 ; 41A15 ; 41A29 ; Spline ; Constrained interpolation ; Smoothing ; Convexity preservation ; shape preservation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Numerical and theoretical questions related to constrained interpolation and smoothing are treated. The prototype problem is that of finding the smoothest convex interpolant to given univariate data. Recent results have shown that this convex programming problem with infinite constraints can be recast as a finite parametric nonlinear system whose solution is closely related to the second derivative of the desired interpolating function. This paper focuses on the analysis of numerical techniques for solving the nonlinear system and on the theoretical issues that arise when certain extensions of the problem are considered. In particular, we show that two standard iteration techniques, the Jacobi and Gauss-Seidel methods, are globally convergent when applied to this problem. In addition we use the problem structure to develop an efficient implementation of Newton's method and observe consistent quadratic convergence. We also develop a theory for the existence, uniqueness, and representation of solutions to the convex interpolation problem with nonzero lower bounds on the second derivative (strict convexity). Finally, a smoothing spline analogue to the convex interpolation problem is studied with reference to the computation of convex approximations to noisy data.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    New York, NY [u.a.] : Wiley-Blackwell
    Numerical Methods for Partial Differential Equations 1 (1985), S. 1-11 
    ISSN: 0749-159X
    Keywords: Mathematics and Statistics ; Numerical Methods
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Mathematics
    Notes: Classical derivations of the so-called Riemann invariants for hyperbolic partial differential equations have depended upon the strong-solution concept. Thus, invariance may rigorously be guaranteed only in regions of smooth flow. In general, this is as much as can be said. However, by restricting attention to linear hyperbolic systems, it further emerges that the Riemann invariant fully justifies its title. By using distribution-theoretical arguments based on the weak-solution concept. Riemann invariants of a more generalized nature are studied. For a particular weak solution u there exists, among the equivalence class [u] of weak solutions that differ from u at most on a set of measure zero, a weak solution u whose Riemann invariant corresponding to characteristic direction λ is constant on lines C: dx/dt = λ. Moreover, every piecewise-smooth weak solution has Riemann invariants that are continuous across a finite jump discontinuity. This result is used to establish for a certain Riemann problem that the one-sided time derivative at a point of discontinuity exhibits a character usually regarded in the literature as flux splitting. This result sheds light upon the validity of some upstream-biased approximation techniques for the numerical solution of hyperbolic systems.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...