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 Institute of Physics (AIP)
    Physics of Fluids 7 (1995), S. 833-838 
    ISSN: 1089-7666
    Source: AIP Digital Archive
    Topics: Physics
    Notes: A simple model in three real dimensions is proposed, illustrating a possible mechanism of transition to turbulence. The linear part of the model is stable but highly non-normal, so that certain inputs experience a great deal of growth before they eventually decay. The nonlinear terms of the model contribute no energy growth, but recycle some of the linear outputs into inputs, closing a feedback loop and allowing initially small solutions to "bootstrap'' to a much larger amplitude. Although different choices of parameters in the nonlinearity lead to a variety of long-term behaviors, the bootstrapping process is essentially independent of the details of the nonlinearity and varies predictably with the Reynolds number. The bootstrapping scenario demonstrated by this model is the basis of some recent explanations for the failure of classical hydrodynamic stability analysis to predict the onset of turbulence in certain flow configurations. © 1995 American Institute of Physics.
    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
    Numerische Mathematik 62 (1992), S. 235-267 
    ISSN: 0945-3245
    Keywords: 65M20 ; 15A18
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary It is well known that a necessary condition for the Lax-stability of the method of lines is that the eigenvalues of the spatial discretization operator, scaled by the time stepk, lie within a distanceO(k) of the stability region of the time integration formula ask→0. In this paper we show that a necessary and sufficient condition for stability, except for an algebraic factor, is that the ε-pseudo-eigenvalues of the same operator lie within a distanceO(ε)+O(k) of the stability region ask, ε→0. Our results generalize those of an earlier paper by considering: (a) Runge-Kutta and other one-step formulas, (b) implicit as well as explicit linear multistep formulas, (c) weighted norms, (d) algebraic stability, (e) finite and infinite time intervals, and (f) stability regions with cusps. In summary, the theory presented in this paper amounts to a transplantation of the Kreiss matrix theorem from the unit disk (for simple power iterations) to an arbitrary stability region (for method of lines calculations).
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    [s.l.] : Nature Publishing Group
    Nature 450 (2007), S. 962-962 
    ISSN: 1476-4687
    Source: Nature Archives 1869 - 2009
    Topics: Biology , Chemistry and Pharmacology , Medicine , Natural Sciences in General , Physics
    Notes: [Auszug] ...A century ago, matrices and the techniques for their manipulation — linear algebra — were a backwater of mathematics. Today, they are the foundation not just of the mathematical field of numerical analysis, but also of computational science and engineering, and have become ...
    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
    Numerische Mathematik 37 (1981), S. 297-320 
    ISSN: 0945-3245
    Keywords: AMS(MOS) 30D50 ; 30E10 ; 41A50
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In a recent paper we showed that error curves in polynomial Chebyshev approximation of analytic functions on the unit disk tend to approximate perfect circles about the origin [23]. Making use of a theorem of Carathéodory and Fejér, we derived in the process a method for calculating near-best approximations rapidly by finding the principal singular value and corresponding singular vector of a complex Hankel matrix. This paper extends these developments to the problem of Chebyshev approximation by rational functions, where non-principal singular values and vectors of the same matrix turn out to be required. The theory is based on certain extensions of the Carathéodory-Fejér result which are also currently finding application in the fields of digital signal processing and linear systems theory. It is shown among other things that iff(ɛz) is approximated by a rational function of type (m, n) for ɛ〉0, then under weak assumptions the corresponding error curves deviate from perfect circles of winding numberm+n+1 by a relative magnitudeO(ɛ m + n + 2 as ɛ→0. The “CF approximation” that our method computes approximates the true best approximation to the same high relative order. A numerical procedure for computing such approximations is described and shown to give results that confirm the asymptotic theory. Approximation ofe z on the unit disk is taken as a central computational example.
    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
    Constructive approximation 6 (1990), S. 195-223 
    ISSN: 1432-0940
    Keywords: Rational approximation ; CF approximation ; H ∞ approximation ; AAK approximation ; Hankel matrix ; 30E10 ; 41A20 ; 30D50
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Letf be a continuous function on the circle ¦z¦=1. We present a theory of the (untruncated) “Carathéodory-Fejér (CF) table” of best supremumnorm approximants tof in the classes $$\tilde R_{mn} $$ of functions $${{\tilde r(z) = \sum\limits_{k = - \infty }^m {a_k z^k } } \mathord{\left/ {\vphantom {{\tilde r(z) = \sum\limits_{k = - \infty }^m {a_k z^k } } {\sum\limits_{k = 0}^n {b_k } z^k ,}}} \right. \kern-\nulldelimiterspace} {\sum\limits_{k = 0}^n {b_k } z^k ,}}$$ , where the series converges in 1〈 ¦z¦ 〈∞. (The casem=n is also associated with the names Adamjan, Arov, and Krein.) Our central result is an equioscillation-type characterization: $$\tilde r \in \tilde R_{mn} $$ is the unique CF approximant $$\tilde r^* $$ tof if and only if $$f - \tilde r$$ has constant modulus and winding numberω≥ m+ n+1−δ on ¦z¦=1, whereδ is the “defect” of $$\tilde r$$ . If the Fourier series off converges absolutely, then $$\tilde r^* $$ is continuous on ¦z¦=1, andω can be defined in the usual way. For general continuousf, $$\tilde r^* $$ may be discontinuous, andω is defined by a radial limit. The characterization theorem implies that the CF table breaks into square blocks of repeated entries, just as in Chebyshev, Padé, and formal Chebyshev-Padé approximation. We state a generalization of these results for weighted CF approximation on a Jordan region, and also show that the CF operator $$K:f \mapsto \tilde r^* $$ is continuous atf if and only if (m, n) lies in the upper-right or lower-left corner of its square block.
    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 68 (1994), S. 403-425 
    ISSN: 0945-3245
    Keywords: Mathematics Subject Classification (1991): 65F35
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary. It is well known that the zeros of a polynomial $p$ are equal to the eigenvalues of the associated companion matrix $A$ . In this paper we take a geometric view of the conditioning of these two problems and of the stability of algorithms for polynomial zerofinding. The $\epsilon$-$pseudozero \: set \: Z_{\epsilon}(p)$ is the set of zeros of all polynomials $\hat{p}$ obtained by coefficientwise perturbations of $p$ of size {$\leq \epsilon$} ; this is a subset of the complex plane considered earlier by Mosier, and is bounded by a certain generalized lemniscate. The $\epsilon$-$pseudospectrum \: \Lambda_\epsilon(A)$ is another subset of ${\Bbb C}$ defined as the set of eigenvalues of matrices {$\hat{A} = A + E$} with $\Vert E\Vert \leq \epsilon$ ; it is bounded by a level curve of the resolvent of $A$. We find that if $A$ is first balanced in the usual EISPACK sense, then $Z_{\epsilon \Vert p\Vert }(p)$ and $\Lambda_{ \epsilon \Vert A\Vert }(A)$ are usually quite close to one another. It follows that the Matlab ROOTS algorithm of balancing the companion matrix, then computing its eigenvalues, is a stable algorithm for polynomial zerofinding. Experimental comparisons with the Jenkins-Traub (IMSL) and Madsen-Reid (Harwell) Fortran codes confirm that these three algorithms have roughly similar stability properties.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Zeitschrift für angewandte Mathematik und Physik 35 (1984), S. 692-704 
    ISSN: 1420-9039
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Physics
    Description / Table of Contents: Zusammenfassung Um den elektrischen Widerstand eines polygonalen Resistors aus einem Material homogener Leitfähigkeit zu berechnen, genügt es, eine konforme Abbildung des Polygons auf ein Rechteck zu finden. Die Konstruktion einer solchen Abbildung erfordert die Lösung eines Schwarz-Christof-felschen Parameterproblems. Wir zeigen zunächst anhand von Beispielen, daß dies numerisch durchführbar ist. Dann betrachten wir ein inverses Problem: Die Aufgabe besteht hier darin, einen Schlitz in ein gegebenes Polygon zu schneiden, dessen Länge gerade so gewählt ist, daß der Widerstand auf einen vorgegebenen Wert erhöht wird. Wir zeigen, daß dieses Problem auf ein „verallgemeinertes Parameterproblem“ zurückgeführt werden kann. Die Idee des verallgemeinerten Parameterproblems ist auch auf viele weitere Schwarz-Christoffel-Probleme anwendbar.
    Notes: Abstract To compute the electrical resistance (≈ conformal modulus) of a polygonally shaped resistor cut from a sheet of uniform resistivity, it suffices to find a conformal map of the polygon onto a rectangle. Constructing such a map requires the solution of a Schwarz-Christoffel parameter problem. First we show by examples that this is practical numerically. Then we consider an inverse “resistor trimming” problem in which the aim is to cut a slit in a given polygon just long enough to increase its resistance to a prescribed value. We show that here the solution can be obtained by solving a “generalized parameter problem.” The idea of a generalized parameter problem is applicable also in many other Schwarz-Christoffel computations.
    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
    BIT 24 (1984), S. 584-591 
    ISSN: 1572-9125
    Keywords: primary 39A11 ; secondary 15A45, 30A10
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The Kreiss Matrix Theorem asserts the uniform equivalence over allN ×N matrices of power boundedness and a certain resolvent estimate. We show that the ratio of the constants in these two conditions grows linearly withN, and we obtain the optimal proportionality factor up to a factor of 2. Analogous results are also given for the related problem involving matrix exponentialse At . The proofs make use of a lemma that may be of independent interest, which bounds the arc length of the image of a circle in the complex plane under a rational function.
    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
    BIT 33 (1993), S. 285-303 
    ISSN: 1572-9125
    Keywords: 65L05 ; stiffness ; stability ; pseudospectra
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract It is argued that even for a linear system of ODEs with constant coefficients, stiffness cannot properly be characterized in terms of the eigenvalues of the Jacobian, because stiffness is a transient phenomenon whereas the significance of eigenvalues is asymptotic. Recent theory from the numerical solution of PDEs is adapted to show that a more appropriate characterization can be based upon pseudospectra instead of spectra. Numerical experiments with an adaptive ODE solver illustrate these findings.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    Title: Approximation theory and approximation practice /
    Author: Trefethen, Lloyd N.
    Year of publication: 2013
    Pages: VII, 305 S. : , graph. Darst.
    ISBN: 978-1-611972-39-9
    Type of Medium: Book
    Language: English
    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...