On the public citation graph

Tchebychev acceleration technique for large scale nonsymmetric matrices

https://doi.org/10.1007/bf01405199
0 signed · 42 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nme.1620100418openalex-snapshot
Subspace iteration accelrated by using Chebyshev polynomials for eigenvalue problems with symmetric matrices
inferredcites →https://doi.org/10.1002/nme.1620190608openalex-snapshot
Lanczos versus subspace iteration for solution of eigenvalue problems
inferredcites →https://doi.org/10.1007/bf01389971openalex-snapshot
The Tchebychev iteration for nonsymmetric linear systems
inferredcites →https://doi.org/10.1007/bf01397475openalex-snapshot
Adaptive procedure for estimating parameters for the nonsymmetric Tchebychev iteration
inferredcites →https://doi.org/10.1007/bf01405199openalex-snapshot
Tchebychev acceleration technique for large scale nonsymmetric matrices
inferredcites →https://doi.org/10.1007/bf01462265openalex-snapshot
Simultaneous iteration for computing invariant subspaces of non-Hermitian matrices
inferredcites →https://doi.org/10.1007/bf02165269openalex-snapshot
Computational aspects of F. L. Bauer's simultaneous iteration method
inferredcites →https://doi.org/10.1016/0024-3795(80)90169-xopenalex-snapshot
Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices
inferredcites →https://doi.org/10.1016/0378-4754(81)90037-9openalex-snapshot
Computing Methods in Applied Sciences and Engineering
inferredcites →https://doi.org/10.1016/0378-4754(87)90109-1openalex-snapshot
Large scale eigenvalue problems
inferredcites →https://doi.org/10.1016/s0304-0208(08)72647-1openalex-snapshot
A Practical Procedure for Computing Eigenvalues of Large Sparse Nonsymmetric Matrices
inferredcites →https://doi.org/10.1051/m2an/1990240100531openalex-snapshot
Arnoldi-Tchebychev procedure for large scale nonsymmetric matrices
inferredcites →https://doi.org/10.1090/s0025-5718-1984-0736453-8openalex-snapshot
Chebyshev Acceleration Techniques for Solving Nonsymmetric Eigenvalue Problems
inferredcites →https://doi.org/10.1093/comjnl/13.1.76openalex-snapshot
The evaluation of eigenvalues and eigenvectors of real symmetric matrices by simultaneous iteration
inferredcites →https://doi.org/10.1093/imamat/15.3.351openalex-snapshot
Simultaneous Iteration for Partial Eigensolution of Real Matrices
inferredcites →https://doi.org/10.1093/imamat/8.1.111openalex-snapshot
A Simultaneous Iteration Method for the Unsymmetric Eigenvalue Problem
inferredcites →https://doi.org/10.1137/0907057openalex-snapshot
A Hybrid Chebyshev Krylov Subspace Algorithm for Solving Nonsymmetric Systems of Linear Equations
inferredcites →https://doi.org/10.1137/1.9780898719192openalex-snapshot
Lanczos Algorithms for Large Symmetric Eigenvalue Computations
inferredcites →https://doi.org/10.1145/55364.55431openalex-snapshot
Arnoldi-Tchebychev for large scale matrices and its vectorization
inferredcites →https://doi.org/10.2307/2007390openalex-snapshot
Sparse Matrices and Their Uses.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/bf01388686openalex-snapshot
A block Arnoldi-Chebyshev method for computing the leading eigenpairs of large sparse unsymmetric matrices
inferred← citeshttps://doi.org/10.1007/bf01388687openalex-snapshot
Block-Arnoldi and Davidson methods for unsymmetric large eigenvalue problems
inferred← citeshttps://doi.org/10.1007/bf01731935openalex-snapshot
Arnoldi-Riccati method for large eigenvalue problems
inferred← citeshttps://doi.org/10.1007/bf01739824openalex-snapshot
A block incomplete orthogonalization method for large nonsymmetric eigenproblems
inferred← citeshttps://doi.org/10.1007/bf02072015openalex-snapshot
Eigenvalues of the discretized Navier-Stokes equation with application to the detection of Hopf bifurcations
inferred← citeshttps://doi.org/10.1007/bf02425912openalex-snapshot
Chebyshev acceleration techniques for large complex non hermitian eigenvalue problems
inferred← citeshttps://doi.org/10.1007/s002110050016openalex-snapshot
An adaptive Chebyshev iterative method\newline for nonsymmetric linear systems based on modified moments
inferred← citeshttps://doi.org/10.1007/s002110050367openalex-snapshot
Generalized block Lanczos methods for large unsymmetric eigenproblems
inferred← citeshttps://doi.org/10.1007/s40314-026-03708-2openalex-snapshot
Efficient computation of dominant eigenvalues using adaptive block Lanczos with Chebyshev filtering
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00238-8openalex-snapshot
Refined iterative algorithms based on Arnoldi's process for large unsymmetric eigenproblems
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00023-2openalex-snapshot
A refined iterative algorithm based on the block Arnoldi process for large unsymmetric eigenproblems
inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00046-0openalex-snapshot
Parallel computation of polynomials with minimal uniform norm and its application to large eigenproblems
inferred← citeshttps://doi.org/10.1023/a:1025681013942openalex-snapshot
An Optimized Iterative Method for Numerical Solution of Large Systems of Equations Based on the Extremal Property of Zeroes of Chebyshev Polynomials
inferred← citeshttps://doi.org/10.1093/imanum/16.3.297openalex-snapshot
Matrix transformations for computing rightmost eigenvalues of large sparse non-symmetric eigenvalue problems
inferred← citeshttps://doi.org/10.1109/hpcc.2009.20openalex-snapshot
A Parallel Refined Block Arnoldi Algorithm for Large Unsymmetric Matrices
inferred← citeshttps://doi.org/10.1137/080718619openalex-snapshot
Time Integration and Steady-State Continuation for 2d Lubrication Equations
inferred← citeshttps://doi.org/10.1137/0917002openalex-snapshot
Calculation of Pseudospectra by the Arnoldi Iteration
inferred← citeshttps://doi.org/10.1145/152613.152614openalex-snapshot
Computing selected eigenvalues of sparse unsymmetric matrices using subspace iteration
inferred← citeshttps://doi.org/10.1145/212066.212091openalex-snapshot
An Arnoldi code for computing selected eigenvalues of sparse, real, unsymmetric matrices
inferred← citeshttps://doi.org/10.11501/3157686openalex-snapshot
Polynomial Acceleration For Large Nonsymmetric Eigenproblems
inferred← citeshttps://doi.org/10.2172/1086621openalex-snapshot
Elgenanalysis of Large Electric Power Systems
showing the first 21 of 22 · page through all 22
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.