Least-Squares Spectral Methods for ODE Eigenvalue Problems
نویسندگان
چکیده
We develop spectral methods for ODEs and operator eigenvalue problems that are based on a least-squares formulation of the problem. The key tool is method rectangular generalized problems, which we extend to quasimatrices objects combining matrices. strength approach its flexibility lies in quasimatrix allowing basis functions be chosen arbitrarily, good choice (e.g., those obtained by solving nearby problems) leading rapid convergence, often giving high accuracy. also show how our algorithm can easily modified solve with eigenvalue-dependent boundary conditions, discuss reformulations as an integral equation, improves
منابع مشابه
Least-squares Spectral Element Methods
In setting up this workshop we had to decide whether we wanted to let you become familiar with the method in a complex setting – non-linear, time-dependent calculations – or restrict ourselves to simpler problems, which allows you to get a better understanding of the method. We have chosen for the second line for several reasons: 1) The method is quite new, so it is hard to find references whic...
متن کاملUsing the eigenvalue relaxation for binary least-squares estimation problems
The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the original problem with an implicit compact constraint and as such, is a convex problem with polynomial time complexity. Moreover, as a main pratical advantage of this relaxation over the standard Sem...
متن کاملGMRES Methods for Least Squares Problems
The standard iterative method for solving large sparse least squares problems min ∈Rn ‖ −A ‖2, A ∈ Rm×n is the CGLS method, or its stabilized version LSQR, which applies the (preconditioned) conjugate gradient method to the normal equation ATA = AT . In this paper, we will consider alternative methods using a matrix B ∈ Rn×m and applying the Generalized Minimal Residual (GMRES) method to min ∈R...
متن کاملNumerical methods for generalized least squares problems
Usually generalized least squares problems are solved by transforming them into regular least squares problems which can then be solved by well-known numerical methods. However, this approach is not very effective in some cases and, besides, is very expensive for large scale problems. In 1979, Paige suggested another approach which consists of solving an equivalent equality-constrained least sq...
متن کاملOn the Least Squares Solution of Inverse Eigenvalue Problems
An inverse eigenvalue problem where a matrix is to be constructed from some or all of its eigenvalues may not have a real valued solution at all An approximate solution in the sense of least squares is sometimes desirable Two types of least squares problems are formulated and explored in this paper In spite of their di erent appearance the two problems are shown to be equivalent Thus one new nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2022
ISSN: ['1095-7197', '1064-8275']
DOI: https://doi.org/10.1137/21m1445934