Results 31 to 40 of about 14,981 (281)

Fast Methods for Solving High Accuracy Surface Modeling

open access: yesJournal of Algorithms & Computational Technology, 2013
High accuracy surface modeling (HASM) is a novel surface modeling method. The well known preconditioned conjugate gradient (PCG) method is used to solve the equations produced by HASM.
Na Zhao, Tian Xiang Yue
doaj   +1 more source

A preconditioned iterative solution scheme for nonlinear parabolic systems arising in air pollution modeling

open access: yesMathematical Modelling and Analysis, 2013
A preconditioned iterative solution method is presented for nonlinear parabolic transport systems. The ingredients are implicit Euler discretization in time and finite element discretization in space, then an outer-inner (outer damped inexact Newton ...
Janos Karatson, Tamas Kurics
doaj   +1 more source

Fast Meshless Reanalysis Using Combined Approximations, Preconditioned Conjugate Gradient, and Taylor Series [PDF]

open access: yes, 2006
Multiple design iterations often require repeated stress analyses to be performed as the design is modified slightly. A method is presented that combines the meshless stress analysis method with a reanalysis technique to avoid repeating the time-consuming
Chipperfield, Kurt   +3 more
core   +3 more sources

Superoptimal Preconditioned Conjugate Gradient Iteration for Image Deblurring [PDF]

open access: yesSIAM Journal on Scientific Computing, 2005
The authors provide a systematic spectral analysis of circulant superoptimal preconditioners for Toeplitz structured linear systems arising from image deblurring. They also study the computational complexity for the computation of superoptimal approximations and present a detailed documentation of numerical results.
DI BENEDETTO, FABIO   +2 more
openaire   +4 more sources

A fast, preconditioned conjugate gradient toeplitz solver

open access: yesComputers & Mathematics with Applications, 1992
The paper describes a fast Toeplitz solver based on the preconditioned conjugate gradient (CG) method. First it describes a factorization of an arbitrary Hermitian, positive definite matrix \(A=(A+\mu I)(I-\mu(A+\mu I)^{-1})\), where \(\mu\) is a parameter.
Pan, Victor, Schreiber, Robert
openaire   +2 more sources

Corrigendum: Block Preconditioning for the Conjugate Gradient Method [PDF]

open access: yesSIAM Journal on Scientific and Statistical Computing, 1985
Concerns the authors' paper [ibid. 6, 220-252 (1985; Zbl 0556.65022)].
Concus, P., Golub, G. H., Meurant, G.
openaire   +2 more sources

Structure of the preconditioned system in various preconditioned conjugate gradient squared algorithms

open access: yesResults in Applied Mathematics, 2019
An improved preconditioned conjugate gradient squared (PCGS) algorithm has recently been proposed, and it performs much better than the conventional PCGS algorithm.
Shoji Itoh, Masaaki Sugihara
doaj   +1 more source

Preconditioned conjugate gradient methods for three‐dimensional linear elasticity [PDF]

open access: yesInternational Journal for Numerical Methods in Engineering, 1994
AbstractFinite element modelling of three‐dimensional elasticity problems give rise to large sparse matrices. Various preconditioning methods are developed for use in preconditioned conjugate gradient iterative solution techniques. Incomplete factorizations based on levels of fill, drop tolerance, and a two‐level hierarchical basis are developed ...
Dickinson, J. K., Forsyth, P A.
openaire   +2 more sources

m-Step Preconditioned Conjugate Gradient Methods [PDF]

open access: yesSIAM Journal on Scientific and Statistical Computing, 1985
The paper deals with the solution of a sparse system of symmetric positive definite linear equations by preconditioned conjugate gradient methods. Necessary and sufficient conditions are found for the applicability of preconditioners that are based on taking m steps of an iterative method. The computer implementation of these methods is discussed.
openaire   +1 more source

Refined Isogeometric Analysis for a preconditioned conjugate gradient solver [PDF]

open access: yesComputer Methods in Applied Mechanics and Engineering, 2018
Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces $C^0$ hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver ...
Daniel Garcia   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy