Results 41 to 50 of about 1,894 (91)

An Accelerated SOR-Like Method for Generalised Saddle Point Problems

East Asian Journal on Applied Mathematics, 2018
A recent accelerated SOR-like method for generalised saddle point problems is discussed. Sufficient conditions for convergence are derived, and some numerical experiments illustrate its effectiveness.
Ting-ting Feng
semanticscholar   +1 more source

A Switching Approach to Avoid Breakdown in Lanczos-Type Algorithms [PDF]

, 2014
Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume ...
M. Farooq, A. Salhi
semanticscholar   +1 more source

Algorithm and linear convergence of the H-spectral radius of weakly irreducible quasi-positive tensors

Open Mathematics
A class of weakly irreducible quasi-positive tensors is defined by using directed hypergraphs of tensors, which generalizes the essential positive tensors, weakly positive tensors, generalized weakly positive tensors, and weakly essential irreducible ...
Lv Hongbin, Chen Meixiang
doaj   +1 more source

A note on the growth factor in Gaussian elimination for generalized Higham matrices

, 2013
The Higham matrix is a complex symmetric matrix A=B+iC, where both B and C are real, symmetric and positive definite and $\mathrm{i}=\sqrt{-1}$ is the imaginary unit. For any Higham matrix A, Ikramov et al.
Gu, Xian-Ming, Guo, Qian-Ping, Li, Hou-biao   +2 more
core  

How to determine the eigenvalues of g-circulant matrices

, 2018
For a given nonnegative integer g, a matrix Cn,g of size n is called g -circulant if Cn,g = [a(r−gs)modn]n−1 r,s=0 . Such matrices arise in wavelet analysis, subdivision algorithms, and more generally when dealing with multigrid/multilevel methods for ...
Eric Ngondiep
semanticscholar   +1 more source

An inverse LU preconditioner based on the Sherman–Morrison formula

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
An approximate inverse LU preconditioner is constructed based on the Sherman–Morrison formula. Applying recursively that inversion formula a multiplicative decomposition of the inverse of a matrix is obtained.
Bru R., Cerdán J., Marín J., Mas J.
doaj   +1 more source

IDDM YARDIMIYLA TERS MATRİS HESAPLAMA

Süleyman Demirel Üniversitesi Fen-Edebiyat Fakültesi Fen Dergisi, 2009
Özet: Bu çalışmada, lineer cebirsel denklem sistemlerinin çözümü için (KESKİN & AYDIN 2007) de verilen iteratif boyut indirgeme metodunu (IDDM) kullanarak verilen regüler matrisin tersini bulan bir metod geliştirdik.
Ali Osman ÇIBIKDİKEN
doaj  

How to Best Choose the Outer Coarse Mesh in the Domain Decomposition Method of Bank and Jimack. [PDF]

Vietnam J Math, 2022
Ciaramella G, Gander MJ, Mamooler P.
europepmc   +1 more source

On the Generalized Deteriorated Positive Semi-Definite and Skew-Hermitian Splitting Preconditioner

Journal of Computational Mathematics, 2019
For nonsymmetric saddle point problems, Huang et al. in (Numer. Algor. 2016, doi: 10.1007/s11075-016-0236-2) established a generalized variant of the deteriorated positive semi-definite and skew-Hermitian splitting (GVDPSS) preconditioner to expedite the
Davod Hezari
semanticscholar   +1 more source

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