On the public citation graph
On complex successive overrelaxation
0 signed · 38 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01086544openalex-snapshot
Computational methods of linear algebra
inferred← citeshttps://doi.org/10.1007/bf01110911openalex-snapshot
Iterationsverfahren und allgemeine Euler-Verfahren
inferred← citeshttps://doi.org/10.1007/bf01390212openalex-snapshot
The analysis ofk-step iterative methods for linear systems from summability theory
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/bf02136034openalex-snapshot
The extrapolated first order method for solving systems with complex eigenvalues
inferred← citeshttps://doi.org/10.1007/bf02162914openalex-snapshot
On generalizations of the theory of consistent orderings for successive over-relaxation methods
inferred← citeshttps://doi.org/10.1007/bf02219233openalex-snapshot
Optimum first and second order extrapolations of Successive Overrelaxation type methods for certain classes of matrices
inferred← citeshttps://doi.org/10.1007/bf02293104openalex-snapshot
Point and block SOR applied to a coupled set of difference equations
inferred← citeshttps://doi.org/10.1007/bfb0067864openalex-snapshot
Problems in applying the SOR-method to the solution of the Maxwell’s time dependent equations
inferred← citeshttps://doi.org/10.1007/s00211-006-0002-9openalex-snapshot
Optimal Semi-Iterative Methods for Complex SOR with Results from Potential Theory
inferred← citeshttps://doi.org/10.1016/0024-3795(87)90058-9openalex-snapshot
Over- and underrelaxation for linear systems with weakly cyclic jacobi matrices of index p
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90370-copenalex-snapshot
Some recent results on the modified SOR theory
inferred← citeshttps://doi.org/10.1016/0024-3795(91)90394-copenalex-snapshot
A parallelizable SOR-like method: Systems with plus-shaped and linear spectra
inferred← citeshttps://doi.org/10.1016/0024-3795(92)90389-ropenalex-snapshot
On the optimum relaxation factor associated with p-cyclic matrices
inferred← citeshttps://doi.org/10.1016/0377-0427(85)90027-5openalex-snapshot
Optimum iterative methods for the solution of singular linear systems arising from the discretization of elliptic P.D.E.'s
inferred← citeshttps://doi.org/10.1016/0377-0427(87)90124-5openalex-snapshot
A survey of the iterative methods for the solution of linear systems by extrapolation, relaxation and other techniques
inferred← citeshttps://doi.org/10.1016/0377-0427(93)90026-8openalex-snapshot
Optimal stretched parameters for the SOR iterative method
inferred← citeshttps://doi.org/10.1016/0377-0427(95)00245-6openalex-snapshot
On the convergence domains of the p-cyclic SOR
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/b978-0-12-100560-3.50024-xopenalex-snapshot
THE AD-HOC SOR METHOD: A LOCAL RELAXATION SCHEME
inferred← citeshttps://doi.org/10.1016/j.laa.2004.12.025openalex-snapshot
On the equivalence of extrapolation and Richardson’s iteration and its applications
inferred← citeshttps://doi.org/10.1016/j.laa.2025.10.019openalex-snapshot
Convergence analysis of optimal SOR for a class of consistently ordered 2-cyclic matrices with complex spectra
inferred← citeshttps://doi.org/10.1016/s0024-3795(96)00410-7openalex-snapshot
Optimal 2-cyclic MSOR for “bowtie” spectra and the “continuous” Manteuffel algorithm
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.1016/s0377-0427(97)00247-1openalex-snapshot
Towards the determination of the optimal p-cyclic SSOR
inferred← citeshttps://doi.org/10.1049/piee.1967.0150openalex-snapshot
Numerical method of calculating eddy currents in nonmagnetic conductors
inferred← citeshttps://doi.org/10.1049/piee.1970.0254openalex-snapshot
Solution of linear steady-state eddy-current problems by complex successive overrelaxation
inferred← citeshttps://doi.org/10.1080/00207160802464605openalex-snapshot
The SOR-kmethod for linear systems withp-cyclic matrices
inferred← citeshttps://doi.org/10.1090/s0025-5718-1972-0311128-xopenalex-snapshot
Coupled Harmonic Equations, SOR, and Chebyshev Acceleration
inferred← citeshttps://doi.org/10.1109/euma.1973.331745openalex-snapshot
Numerical Solution for Waveguioes with Inhomogeneous Lossy Loads
inferred← citeshttps://doi.org/10.1137/0611045openalex-snapshot
The Young–Eidson Algorithm: Applications and Extensions
inferred← citeshttps://doi.org/10.1137/20m1342161openalex-snapshot
Optimal Complex Relaxation Parameters in Multigrid for Complex-Shifted Linear Systems
inferred← citeshttps://doi.org/10.1137/s0036142995294292openalex-snapshot
On SOR Waveform Relaxation Methods
inferred← citeshttps://doi.org/10.1137/s0895479896309827openalex-snapshot
Analysis of Iterative Line Spline Collocation Methods for Elliptic Partial Differential Equations
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.