Computing the Evans Function Using Grassmannians

نویسنده

  • VEERLE LEDOUX
چکیده

We present a numerical method for computing the pure-point spectrum associated with the linear stability of coherent structures. Our method is based on the Evans function shooting and matching approach. The Grassmann representatives for the stable and unstable manifolds of the spectral problem suffice to construct the Evans function. Our idea is to fix a coordinate patch for the Grassmann representatives of each manifold and numerically compute in that representation. We are thus required to solve a nonlinear Riccati differential equation for each manifold. In practice the method is stable, robust, analytic in the spectral parameter and of complexity bounded by the order of the spectral problem. For large systems it represents a competitive method to that proposed by Humpherys and Zumbrun [21]. We demonstrate this by comparing the two methods in three applications: Boussinesq solitary waves, autocatalytic travelling waves and Ekman boundary layer.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Degenerations of Surface Scrolls and the Gromov-Witten Invariants of Grassmannians

We describe an algorithm for computing certain characteristic numbers of rational normal surface scrolls using degenerations. As a corollary we obtain an efficient method for computing the corresponding Gromov-Witten invariants of the Grassmannians of lines.

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

On the Cardinalities of Kronecker Quiver Grassmannians

Abstract. We deduce using the Ringel-Hall algebra approach explicit formulas for the cardinalities of some Grassmannians over a finite field associated to the Kronecker quiver. We realize in this way a quantification of the formulas obtained by Caldero and Zelevinsky for the Euler characteristics of these Grassmannians. We also present a recursive algorithm for computing the cardinality of ever...

متن کامل

Bayesian Sample Size Computing for Estimation of Binomial Proportions using p-tolerance with the Lowest Posterior Loss

This paper is devoted to computing the sample size of binomial distribution with Bayesian approach. The quadratic loss function is considered and three criterions are applied to obtain p-tolerance regions with the lowest posterior loss. These criterions are: average length, average coverage and worst outcome.

متن کامل

On the WZ Factorization of the Real and Integer Matrices

The textit{QIF}  (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ}  factorization. The  WZ factorization can be faster than the textit{LU} factorization  because,  it performs the simultaneous evaluation of two columns or two rows. Here, we present a  method for computing the real and integer textit{WZ} and  textit{ZW} factoriz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007