Pages that link to "Item:Q1150999"
From MaRDI portal
The following pages link to Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices (Q1150999):
Displayed 50 items.
- Computer-aided analysis of the convergence to steady state of discrete approximations to the Euler equations (Q579079) (← links)
- Lanczos maximal algorithm for unsymmetric eigenvalue problems (Q753415) (← links)
- On acceleration methods for coupled nonlinear elliptic systems (Q758154) (← links)
- Rational Krylov sequence methods for eigenvalue computation (Q760159) (← links)
- On the simplification of generalized conjugate-gradient methods for nonsymmetrizable linear systems (Q791277) (← links)
- Numerical aspects of Gram-Schmidt orthogonalization of vectors (Q1052042) (← links)
- An application of the Arnoldi method to a geophysical fluid dynamics problem (Q1085711) (← links)
- Complex shift and invert strategies for real matrices (Q1091758) (← links)
- Lanczos algorithms and field of value rotations for symmetric matrix pencils (Q1091760) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- An efficient method for computing leading eigenvalues and eigenvectors of large asymmetric matrices (Q1116650) (← links)
- Finding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblem (Q1123539) (← links)
- Reduced storage matrix methods in stiff ODE systems (Q1123558) (← links)
- A method for the numerical computation of Hopf bifurcation (Q1126565) (← links)
- Parallel subspace method for non-Hermitian eigenproblems on the Connection Machine (CM2) (Q1188308) (← links)
- Quasi-kernel polynomials and their use in non-Hermitian matrix iterations (Q1195726) (← links)
- An efficient nonsymmetric Lanczos method on parallel vector computers (Q1200180) (← links)
- Generalizations of Davidson's method for computing eigenvalues of large nonsymmetric matrices (Q1201054) (← links)
- Large-scale complex eigenvalue problems (Q1262079) (← links)
- Polynomial preconditioning in Krylov-ROW-methods (Q1294525) (← links)
- A variation on the block Arnoldi method for large unsymmetric matrix eigenproblems (Q1299851) (← links)
- Rational Krylov algorithms for nonsymmetric eigenvalue problems. II: Matrix pairs (Q1319992) (← links)
- An exploratory study of a subspace iteration method as an alternative to the QR method for Floquet eigenanalysis (Q1324703) (← links)
- A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices (Q1326400) (← links)
- A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations (Q1326402) (← links)
- A generalized ADI iterative method (Q1326479) (← links)
- A generalized nonsymmetric Lanczos procedure (Q1330632) (← links)
- Numerical solution of large nonsymmetric eigenvalue problems (Q1330635) (← links)
- The rational Krylov algorithm for nonsymmetric eigenvalue problems. III: Complex shifts for real matrices (Q1343049) (← links)
- Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems (Q1362621) (← links)
- Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems (Q1372035) (← links)
- On a variable smoothing procedure for Krylov subspace methods (Q1375088) (← links)
- A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems (Q1377506) (← links)
- Linear stability of incompressible flow using a mixed finite element method (Q1387873) (← links)
- The numerical solution of stochastic automata networks (Q1390239) (← links)
- A fast implementation for GMRES method (Q1414304) (← links)
- Eigensolution of nonclassically damped structures by complex subspace iteration (Q1581968) (← links)
- Eigenvalue computation in the 20th century (Q1591174) (← links)
- Fejér-Walsh points for rational functions and their use in the ADI iterative method (Q1802163) (← links)
- Krylov subspace methods for eigenvalues with special properties and their analysis for normal matrices (Q1808929) (← links)
- Tchebychev acceleration technique for large scale nonsymmetric matrices (Q1825594) (← links)
- An iterative block Arnoldi algorithm with modified approximate eigenvectors for large unsymmetric eigenvalue problems (Q1827036) (← links)
- Numerical comparison of iterative eigensolvers for large sparse symmetric positive definite matrices (Q1871007) (← links)
- Numerical solutions for large sparse quadratic eigenvalue problems (Q1899377) (← links)
- A direct method for computation of simple bifurcations (Q1903788) (← links)
- An efficient code to compute non-parallel steady flows and their linear stability (Q1905635) (← links)
- A block incomplete orthogonalization method for large nonsymmetric eigenproblems (Q1907872) (← links)
- The Padé-Rayleigh-Ritz method for solving large Hermitian eigenproblems (Q1911447) (← links)
- Ritz and pseudo-Ritz values using matrix polynomials (Q1923177) (← links)
- Efficient time integration of Navier-Stokes equations (Q1975658) (← links)