Results 31 to 40 of about 316 (109)
In this article, we present two new algorithms referred to as the improved modified gradient-based iterative (IMGI) algorithm and its relaxed version (IMRGI) for solving the complex conjugate and transpose (CCT) Sylvester matrix equations, which often ...
Huang Zhengge, Cui Jingjing
doaj +1 more source
The iterative methods for solving nonlinear matrix equation X+A⋆X−1A+B⋆X−1B=Q
In this paper, we study the matrix equation X+A⋆X−1A+B⋆X−1B=Q, where A and B are square matrices, and Q is a positive definite matrix, and propose the iterative methods for finding positive definite solutions of the matrix equation.
S. Vaezzadeh +3 more
semanticscholar +1 more source
An implicit evaluation method of vector 2-norms is presented for function evaluations arising from sphere constrained quadratic optimizations. The efficiency of the method in terms of computational costs mainly comes from the well-known shifted conjugate
T. Suzuki
semanticscholar +1 more source
An Accelerated SOR-Like Method for Generalised Saddle Point Problems
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]
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
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
How to determine the eigenvalues of g-circulant matrices
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
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
Ö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
On the Generalized Deteriorated Positive Semi-Definite and Skew-Hermitian Splitting Preconditioner
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

