On the public citation graph

Optimality relationships forp-cyclic SOR

https://doi.org/10.1007/bf01405193
0 signed · 34 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/bf01386430openalex-snapshot
Optimal successive overrelaxation iterative methods for P-cyclic matrices
inferredcites →https://doi.org/10.1016/0024-3795(84)90218-0openalex-snapshot
Convergence of block iterative methods applied to sparse least-squares problems
inferredcites →https://doi.org/10.1016/0024-3795(85)90073-4openalex-snapshot
Convergence of a direct-iterative method for large-scale least-squares problems
inferredcites →https://doi.org/10.1016/0024-3795(87)90058-9openalex-snapshot
Over- and underrelaxation for linear systems with weakly cyclic jacobi matrices of index p
inferredcites →https://doi.org/10.1016/0378-4754(88)90001-8openalex-snapshot
On the equivalence of the k-step iterative euler methods and successive overrelaxation (SOR) methods for k-cyclic matrices
inferredcites →https://doi.org/10.1016/c2013-0-11733-3openalex-snapshot
Iterative Solution of Large Linear Systems
inferredcites →https://doi.org/10.1090/s0002-9947-1954-0059635-7openalex-snapshot
Iterative Methods for Solving Partial Difference Equations of Elliptic Type
inferredcites →https://doi.org/10.1137/0720085openalex-snapshot
On the Construction of Semi-Iterative Methods
inferredcites →https://doi.org/10.2140/pjm.1959.9.617openalex-snapshot
p -cyclic matrices: A generalization of the Young-Frankel successive overrelaxation scheme
inferredcites →https://doi.org/10.2307/2003862openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.2307/2005542openalex-snapshot
Iterative Solution of Large Linear Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4613-8351-2_8openalex-snapshot
Analysis of P-Cyclic Iterations for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-031-04028-3_15openalex-snapshot
Solution of Peak Junction Temperature with Crank-Nicolson and SOR Approach
inferred← citeshttps://doi.org/10.1007/bf01386419openalex-snapshot
Domains of divergence of the USSOR method applied onp-cyclic matrices
inferred← citeshttps://doi.org/10.1007/bf01386430openalex-snapshot
Optimal successive overrelaxation iterative methods for P-cyclic matrices
inferred← citeshttps://doi.org/10.1007/bf01386432openalex-snapshot
An iterative substructuring algorithm for equilibrium equations
inferred← citeshttps://doi.org/10.1007/bf01739821openalex-snapshot
Exact SOR convergence regions for a general class ofp-cyclic matrices
inferred← citeshttps://doi.org/10.1007/s002110050039openalex-snapshot
Optimal $p$ --cyclic SOR
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90371-3openalex-snapshot
Order-reducing conjugate gradients versus block AOR for constrained least-squares problems
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90377-9openalex-snapshot
Block cyclic SOR for Markov chains with p-cyclic infinitesimal generator
inferred← citeshttps://doi.org/10.1016/0168-9274(91)90066-9openalex-snapshot
On some convergence results of the k-step iterative methods
inferred← citeshttps://doi.org/10.1016/0377-0427(94)00098-1openalex-snapshot
Superior convergence domains for the p-cyclic SSOR majorizer
inferred← citeshttps://doi.org/10.1016/j.apnum.2009.08.006openalex-snapshot
p-Cyclic SOR for BVPs with periodic boundary conditions
inferred← citeshttps://doi.org/10.1016/j.cam.2003.08.045openalex-snapshot
Block Gauss elimination followed by a classical iterative method for the solution of linear systems
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00180-4openalex-snapshot
Dedication to Robert J. Plemmons
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00538-1openalex-snapshot
Optimal p-cyclic SOR for complex spectra
inferred← citeshttps://doi.org/10.1016/s0024-3795(98)10165-9openalex-snapshot
A Young-Eidson's type algorithm for complex p-cyclic SOR spectra
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00403-9openalex-snapshot
Numerical analysis 2000 - Vol. III: Linear algebra
inferred← citeshttps://doi.org/10.1080/00207160802464605openalex-snapshot
The SOR-kmethod for linear systems withp-cyclic matrices
inferred← citeshttps://doi.org/10.1080/00207169208804066openalex-snapshot
Numerical solution of a periodic parabolic problem
inferred← citeshttps://doi.org/10.1080/00207169208804131openalex-snapshot
Sor and related methods forp-cyclic systems
inferred← citeshttps://doi.org/10.1080/00207169808804628openalex-snapshot
Preconditioning the linear system for the sor method
inferred← citeshttps://doi.org/10.1137/0613010openalex-snapshot
Best Cyclic Repartitioning for Optimal Successive Overrelaxation Convergence
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.