Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration

DOI10.1007/BF01397475zbMath0413.65032OpenAlexW2075962499MaRDI QIDQ598774

Publication date: 1978

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/132575

zbMATH Keywords

stability power method Tchebychev iteration nonsymmetric adaptive procedure estimates of the convex hull of the spectrum estimating parameters large sparce nonsymmetric linear systems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10)

Related Items (max. 100)

A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices ⋮ A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations ⋮ A generalized ADI iterative method ⋮ An iterative solution method for solving sparse nonsymmetric linear systems ⋮ A historical overview of iterative methods ⋮ Domain decomposition methods for the parallel computation of reacting flows ⋮ Interpolating discrete advection--diffusion propagators at Leja sequences ⋮ Region-dependent optimal \(m\)-stage Runge-Kutta schemes for solving a class of nonsymmetric linear systems ⋮ Fast solution of a class of periodic pseudodifferential equations ⋮ Stepsize restrictions for stability in the numerical solution of ordinary and partial differential equations ⋮ A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques ⋮ An optimum iterative method for solving any linear system with a square matrix ⋮ A simpler GMRES algorithm accelerated by Chebyshev polynomials for computing PageRank ⋮ Liouville-Green asymptotic approximation for a class of matrix differential equations and semi-discretized partial differential equations ⋮ Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices ⋮ Locally optimal and heavy ball GMRES methods ⋮ Leapfrog variants of iterative methods for linear algebraic equations ⋮ Optimal 2-cyclic MSOR for ``bowtie spectra and the ``continuous Manteuffel algorithm ⋮ Iterative techniques for solving simultaneous equation systems: A view from the economics literature ⋮ Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems ⋮ Chebyshev acceleration techniques for large complex non Hermitian eigenvalue problems ⋮ On semiiterative methods generated by Faber polynomials ⋮ Hybrid MPE-iterative schemes for linear and nonlinear systems ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. part I: Theory ⋮ Parallelizable restarted iterative methods for nonsymmetric linear systems. II: parallel implementation ⋮ Accelerating the Arnoldi-type algorithm for the PageRank problem and the ProteinRank problem ⋮ High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations ⋮ Chebyshev acceleration of iterative refinement ⋮ Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems ⋮ On the generation of Krylov subspace bases ⋮ On the acceleration of Kaczmarz's method for inconsistent linear systems ⋮ A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method ⋮ A parallelizable SOR-like method: Systems with plus-shaped and linear spectra ⋮ Direct optimization of BPX preconditioners ⋮ A novel nonsymmetric \(K\)-Lanczos algorithm for the generalized nonsymmetric \(K\)-eigenvalue problems ⋮ A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators ⋮ Modified successive overrelaxation (MSOR) and equivalent 2-step iterative methods for collocation matrices ⋮ Improving the arithmetic intensity of multigrid with the help of polynomial smoothers ⋮ An adaptive method for solving nonsymmetric linear systems involving applications of SCPACK ⋮ THE COMPUTATION OF FUNCTIONS OF MATRICES BY TRUNCATED FABER SERIES ⋮ An interpolatory approximation of the matrix exponential based on Faber polynomials ⋮ A method for the improvement of the convergence rates of stationary iterative schemes for the solution of complex linear systems ⋮ Approximation on disjoint intervals and its applicability to matrix preconditioning ⋮ Multigrid methods for convection-diffusion problems discretized by a monotone scheme ⋮ Rational Krylov sequence methods for eigenvalue computation ⋮ Assessing the performance of an optimization-based multilevel method ⋮ Tchebychev acceleration technique for large scale nonsymmetric matrices ⋮ Polynomial approximation of functions of matrices and applications ⋮ An adaptive \(s\)-step conjugate gradient algorithm with dynamic basis updating. ⋮ GMRES and the minimal polynomial ⋮ Proxy-GMRES: Preconditioning via GMRES in Polynomial Space ⋮ Iterative solution of linear systems in the 20th century ⋮ Successive overrelaxation (SOR) and related methods ⋮ The optimal solution to the problem of complex extrapolation of a first- order scheme ⋮ Optimum sor methods for a class of linear systems ⋮ Some recent results on the modified SOR theory ⋮ Implementation of an adaptive algorithm for Richardson's method

Cites Work

This page was built for publication: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration