A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices

From MaRDI portal
Revision as of 07:51, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3678568

DOI10.2307/2007796zbMath0564.65022OpenAlexW4243850947MaRDI QIDQ3678568

Beresford N. Parlett, Derek R. Taylor, Zhishun A. Liu

Publication date: 1985

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2007796




Related Items (99)

A look-ahead algorithm for the solution of general Hankel systemsAn analysis of the composite step biconjugate gradient methodThe multipoint Padé table and general recurrences for rational interpolationThe Gauss quadrature for general linear functionals, Lanczos algorithm, and minimal partial realizationA generalized nonsymmetric Lanczos procedureNumerical solution of large nonsymmetric eigenvalue problemsA backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchangesA composite step conjugate gradients squared algorithm for solving nonsymmetric linear systemsTreatment of near-breakdown in the CGS algorithmKrylov type subspace methods for matrix polynomialsThe second-order biorthogonalization procedure and its application to quadratic eigenvalue problemsComplex shift and invert strategies for real matricesLanczos algorithms and field of value rotations for symmetric matrix pencilsExploiting the composite step strategy to the biconjugate \(A\)-orthogonal residual method for non-Hermitian linear systemsA new technique for determining coupled modes of structure-acoustic systemsLanczos-type variants of the COCR method for complex nonsymmetric linear systemsOn the squared unsymmetric Lanczos methodA Rayleigh-Chebyshev procedure for finding the smallest eigenvalues and associated eigenvectors of large sparse Hermitian matricesNumerical solutions for large sparse quadratic eigenvalue problemsLook-ahead in Bi-CGSTAB and other product methods for linear systemsBreakdowns and stagnation in iterative methodsMaintaining convergence properties of BiCGStab methods in finite precision arithmeticThe methods of Vorobyev and LanczosA transpose-free quasi-minimal residual variant of the CORS method for solving non-Hermitian linear systemsAn implicitly restarted symplectic Lanczos method for the Hamiltonian eigenvalue problemSPMR: A Family of Saddle-Point Minimum Residual SolversAn engineering approach to generalized conjugate gradient methods and beyondA theoretical overview of Krylov subspace methodsAn overview of approaches for the stable computation of hybrid BiCG methodsSoftware for simplified Lanczos and QMR algorithmsA comparative study of iterative solutions to linear systems arising in quantum mechanicsFinding leading modes of a viscous free surface flow: An asymmetric generalized eigenproblemA rational Lanczos algorithm for model reductionAn adaptive block Lanczos algorithmA linear system solver based on a modified Krylov subspace method for breakdown recoveryArnoldi versus nonsymmetric Lanczos algorithms for solving matrix eigenvalue problemsA Lanczos-type procedure for tensorsA unified approach to Krylov subspace methods for solving linear systemsA restarted induced dimension reduction method to approximate eigenpairs of large unsymmetric matricesA new quasi-minimal residual method based on a biconjugate \(A\)-orthonormalization procedure and coupled two-term recurrencesNumerical solution of linear eigenvalue problemsA Lanczos-like method for non-autonomous linear ordinary differential equationsKrylov Subspace Solvers and PreconditionersA Krylov subspace projection method for simultaneous solution of Helmholtz problems at multiple frequencies.Introduction to a Gram-Schmidt-type biorthogonalization methodAn augmented analysis of the perturbed two-sided Lanczos tridiagonalization processOn restarting the Arnoldi method for large nonsymmetric eigenvalue problemsUnstable modes in projection-based reduced-order models: how many can there be, and what do they tell you?QMR: A quasi-minimal residual method for non-Hermitian linear systemsA new iterative method for solving complex symmetric linear systemsBiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error PropertyNonsymmetric Lanczos and finding orthogonal polynomials associated with indefinite weightsAn extended nonsymmetric block Lanczos method for model reduction in large scale dynamical systemsIterative methods for solving \(Ax=b\), GMRES/FOM versus QMR/BiCGA novel nonsymmetric \(K\)-Lanczos algorithm for the generalized nonsymmetric \(K\)-eigenvalue problemsBreakdowns in the implementation of the Lánczos method for solving linear systemsA superfast algorithm for multi-dimensional Padé systemsThe Lanczos algorithm and Hankel matrix factorizationQuasi-kernel polynomials and their use in non-Hermitian matrix iterationsThe Lanczos algorithm and complex Gauss quadratureA Breakdown-Free Variation of the Nonsymmetric Lanczos AlgorithmsAn efficient nonsymmetric Lanczos method on parallel vector computersGeneralizations of Davidson's method for computing eigenvalues of large nonsymmetric matricesA new implementation of the CMRH method for solving dense linear systemsML(\(n\))BiCGStabt: a ML(\(n\))BiCGStab variant with \(\mathbf A\)-transposeError Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue ProblemComputation of matrix-valued formally orthogonal polynomials and applicationsSimultaneous similarity reductions for a pair of matrices to condensed formsA modified second-order Arnoldi method for solving the quadratic eigenvalue problemsAn explicit formula for Lanczos polynomialsCommunication lower bounds and optimal algorithms for numerical linear algebraSaving flops in LU based shift-and-invert strategyMatrix-Padé via Lanczos solutions for vibrations of fluid-structure interactionRestarted Q-Arnoldi-type methods exploiting symmetry in quadratic eigenvalue problemsLow-Rank Modification of the Unsymmetric Lanczos AlgorithmLanczos-type algorithms for solving systems of linear equationsKrylov space methods on state-space control modelsStable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systemsLarge-scale complex eigenvalue problemsLanczos maximal algorithm for unsymmetric eigenvalue problemsCommunication in complex networksUnnamed ItemUnnamed ItemKrylov subspace projection method and its application to oil reservoir simulationEigensolution of nonclassically damped structures by complex subspace iterationA Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity ProblemExtending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sidesOn the partial realization problemIterative solution of linear systems in the 20th centuryEigenvalue computation in the 20th centuryReduced Order Modeling for Time-Dependent Optimization Problems with Initial Value ControlsThe symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos methodA Lanczos-type method for multiple starting vectorsRational interpolation via orthogonal plynomialsSolving linear equations over GF(2): Block Lanczos algorithmA review of formal orthogonality in Lanczos-based methodsThe nonsymmetric Lanczos algorithm and controllabilityA breakdown-free Lanczos type algorithm for solving linear systemsAn exploratory study of a subspace iteration method as an alternative to the QR method for Floquet eigenanalysis







This page was built for publication: A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices