A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations (Q1326402): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The principle of minimized iterations in the solution of the matrix eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semiiterative methods generated by Faber polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fields of values and iterative methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hybrid Semi-Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Construction of Semi-Iterative Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of semiiterative methods for nonsymmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The near-best solution of a polynomial minimization problem by the Carathéodory-Fejér method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of Faber Series With Application to Numerical Polynomial Approximation in the Complex Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The use of Faber polynomials to solve systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev polynomials are not always optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752617 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev semi-iterative methods, successive overrelaxation iterative methods, and second order Richardson iterative methods. I, II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3749498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3699980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Faber polynomials and Faber expansions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid GMRES Algorithm for Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The analysis of k-step iterative methods for linear systems from summability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Konforme Abbildung und Fekete-Punkte / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Certain Problems of Approximation and Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Squares Polynomials in the Complex Plane and Their Use for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of an adaptive algorithm for Richardson's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Computation of the Schwarz–Christoffel Transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-circularity of the error curve in complex Chebyshev approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3978918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Successive Overrelaxation Method and Semi-Iterative Methods Using Chebyshev Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: NOTE ON DEGREE OF APPROXIMATION TO ANALYTIC FUNCTIONS BY RATIONAL FUNCTIONS WITH PREASSIGNED POLES / rank
 
Normal rank

Latest revision as of 15:57, 22 May 2024

scientific article
Language Label Description Also known as
English
A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations
scientific article

    Statements

    A hybrid Arnoldi-Faber iterative method for nonsymmetric systems of linear equations (English)
    0 references
    0 references
    0 references
    0 references
    8 September 1994
    0 references
    A new hybrid Arnoldi-Faber method for the iterative solution of large sparse nonsymmetric linear systems is presented. Numerical results are given.
    0 references
    0 references
    0 references
    iterative method
    0 references
    sparse system
    0 references
    numerical results
    0 references
    hybrid Arnoldi-Faber method
    0 references
    large sparse nonsymmetric linear systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references