Results 41 to 50 of about 217 (109)
A Method for Solving Hermitian Pentadiagonal Block Circulant Systems of Linear Equations Abstract
, 2008 A new effective method and its two modifications for solving Hermitian pentadiagonal block circulant systems of linear equations are proposed. New algorithms based on the proposed method are constructed.
Ivan G. Ivanov B, Borislav V. Minchev A
core
Fast iterative solvers for discrete Stokes equations
, 2004 . We consider saddle point problems that result from the finite element discretization of stationary and instationary Stokes equations. Three efficient iterative solvers for these problems are treated, namely the preconditioned CG method introduced by ...
Reichelt, Volker +5 more
core +1 more source
, 2016 In this paper, we propose a fast one-parameter variant of preconditioned Uzawa (OVPU) method with a scaled preconditioner for solving the saddle point problems, and then we present its convergence region and a formula for finding its optimal parameter ...
Yun, Jae Heon
core
FastTrack Peer-to-Peer technology company
, 2001 We adapt the principle of auxiliary space preconditioning as presented in [J. Xu, The auxiliary space method and optimal multigrid preconditioning techniques for unstructured grids, Computing, 56 (1996), pp.
G. Widmer, J. Zou, R. Hiptmair
core
On the convergence theory of double K-weak splittings of type II. [PDF]
Appl Math (Prague), 2022 Shekhar V, Mishra N, Mishra D.
europepmc +1 more source
This study presents a numerical matrix collocation method for solving Bratu equations, Riccati equations, and high-order linear/nonlinear differential equations with delay variables—all of which hold significant importance in the literature ...
Baykuş Savaşaneril, Nurcan +1 more
core +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
J Sci Comput, 2021 Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source
IDDM YARDIMIYLA TERS MATRİS HESAPLAMA
, 2019 Özet: Bu çalışmada, lineer cebirsel denklem sistemlerinin çözümü için (KESKİN &AYDIN 2007) de verilen iteratif boyut indirgeme metodunu (IDDM) kullanarak verilenregüler matrisin tersini bulan bir metod geliştirdik.
ÇIBIKDİKEN, Ali Osman
core +2 more sources
Algebraic Multigrid By Smoothed Aggregation For Second And Fourth Order Elliptic Problems
, 1995 . An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically.
JAN MANDEL +3 more
core
Fast Algorithms for Solving High-Order Finite Element Equations for Incompressible Flow
, 1995 We discuss high-order finite element methods to simulate the flow of incompressible viscous fluids. We focus on algorithms for solving the related algebraic equations efficiently using the iterated penalty method for resolving the incompressibility ...
Ridgway Scott +3 more
core