On the public citation graph

Modified block-approximate factorization strategies

https://doi.org/10.1007/bf01385499
0 signed · 49 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.1007/978-3-642-05156-2openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.1007/bf01389447openalex-snapshot
On the eigenvalue distribution of a class of preconditioning methods
inferredcites →https://doi.org/10.1007/bf01389450openalex-snapshot
The rate of convergence of Conjugate Gradients
inferredcites →https://doi.org/10.1007/bf01932740openalex-snapshot
Incomplete factorizations of singular linear systems
inferredcites →https://doi.org/10.1007/bf01932955openalex-snapshot
A generalized SSOR method
inferredcites →https://doi.org/10.1007/bf01933408openalex-snapshot
The evaluation and application of some modified moments
inferredcites →https://doi.org/10.1007/bfb0090898openalex-snapshot
Modified incomplete factorization strategies
inferredcites →https://doi.org/10.1007/bfb0090905openalex-snapshot
The convergence behaviour of preconditioned CG and CG-S in the presence of rounding errors
inferredcites →https://doi.org/10.1016/0021-9991(78)90098-0openalex-snapshot
The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equations
inferredcites →https://doi.org/10.1016/0024-3795(84)90088-0openalex-snapshot
Upper eigenvalue bounds for pencils of matrices
inferredcites →https://doi.org/10.1016/0024-3795(85)90214-9openalex-snapshot
On Axelsson's perturbations
inferredcites →https://doi.org/10.1016/0024-3795(87)90211-4openalex-snapshot
Lower eigenvalue bounds for pencils of matrices
inferredcites →https://doi.org/10.1016/0024-3795(91)90395-dopenalex-snapshot
On the conditioning analysis of block approximate factorization methods
inferredcites →https://doi.org/10.1016/0024-3795(91)90400-qopenalex-snapshot
Conditioning analysis of modified block incomplete factorizations
inferredcites →https://doi.org/10.1016/0024-3795(93)90320-nopenalex-snapshot
Analytical bounds for block approximate factorization methods
inferredcites →https://doi.org/10.1016/0168-9274(91)90096-iopenalex-snapshot
Conditioning analysis of sparse block approximate factorizations
inferredcites →https://doi.org/10.1016/0377-0427(89)90298-7openalex-snapshot
Conditioning analysis of positive definite matrices by approximate factorizations
inferredcites →https://doi.org/10.1016/0377-0427(89)90372-5openalex-snapshot
Vectorizable preconditioners for elliptic difference equations in three space dimensions
inferredcites →https://doi.org/10.1016/0899-8248(89)90029-3openalex-snapshot
Linear iterations as smoothers in multigrid methods: Theory with applications to incomplete decompositions
inferredcites →https://doi.org/10.1016/c2013-0-10361-3openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0559197-0openalex-snapshot
An Incomplete Factorization Technique for Positive Definite Linear Systems
inferredcites →https://doi.org/10.1137/0724070openalex-snapshot
On Sparse Block Factorization Iterative Methods
inferredcites →https://doi.org/10.1137/0725053openalex-snapshot
Existence and Conditioning Properties of Sparse Approximate Block Factorizations
inferredcites →https://doi.org/10.1137/0906018openalex-snapshot
Block Preconditioning for the Conjugate Gradient Method
inferredcites →https://doi.org/10.1137/0910004openalex-snapshot
CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
inferredcites →https://doi.org/10.1137/0910043openalex-snapshot
On the Robustness of ILU Smoothing
inferredcites →https://doi.org/10.1137/1.9781611971262openalex-snapshot
Nonnegative Matrices in the Mathematical Sciences
inferredcites →https://doi.org/10.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.2307/2003862openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1099-1506(199907/08)6:5<379::aid-nla170>3.0.co;2-popenalex-snapshot
Efficient planewise-like preconditioners for solving 3D problems
inferred← citeshttps://doi.org/10.1002/nla.247openalex-snapshot
Spectral analysis of parallel incomplete factorizations with implicit pseudo‐overlap
inferred← citeshttps://doi.org/10.1007/978-3-322-85732-3_8openalex-snapshot
Empirically modified block incomplete factorizations
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_6openalex-snapshot
Approximate and Incomplete Factorizations
inferred← citeshttps://doi.org/10.1007/bf02356140openalex-snapshot
Eigenvalue bounds for block preconditioned matrices
inferred← citeshttps://doi.org/10.1016/0024-3795(93)90320-nopenalex-snapshot
Analytical bounds for block approximate factorization methods
inferred← citeshttps://doi.org/10.1016/0167-739x(94)00058-mopenalex-snapshot
Implementation of parallel block preconditionings on a transputer-based multiprocessor
inferred← citeshttps://doi.org/10.1016/0168-9274(94)00045-xopenalex-snapshot
Graph perturbations
inferred← citeshttps://doi.org/10.1016/0168-9274(95)00094-1openalex-snapshot
Incomplete block factorization preconditioning for linear systems arising in the numerical solution of the Helmholtz equation
inferred← citeshttps://doi.org/10.1016/b978-0-444-50617-7.50009-4openalex-snapshot
Iterative solution of linear systems in the 20th century
inferred← citeshttps://doi.org/10.1016/j.apnum.2004.06.003openalex-snapshot
Iterative solution methods
inferred← citeshttps://doi.org/10.1016/s0168-9274(98)00133-0openalex-snapshot
A multilevel block incomplete factorization preconditioning
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00412-xopenalex-snapshot
Iterative solution of linear systems in the 20th century
inferred← citeshttps://doi.org/10.1016/s0377-0427(97)00023-xopenalex-snapshot
A survey of some estimates of eigenvalues and condition numbers for certain preconditioned matrices
inferred← citeshttps://doi.org/10.1023/a:1019191715286openalex-snapshot
Experimental comparison of three-dimensional point and line modified incomplete factorizations
inferred← citeshttps://doi.org/10.1137/0916024openalex-snapshot
Ordering Strategies for Modified Block Incomplete Factorizations
inferred← citeshttps://doi.org/10.1137/s0036144594266284openalex-snapshot
Taking Advantage of the Potentialities of Dynamically Modified Block Incomplete Factorizations
inferred← citeshttps://doi.org/10.1137/s1064827594270415openalex-snapshot
Approximate Inverse Preconditioners via Sparse-Sparse Iterations
inferred← citeshttps://doi.org/10.1137/s1064827596311591openalex-snapshot
Dynamically Relaxed Block Incomplete Factorizations for Solving Two- and Three-Dimensional Problems
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.