Results 21 to 30 of about 1,646 (46)

New recurrence relationships between orthogonal polynomials which lead to new Lanczos-type algorithms [PDF]

, 2012
Lanczos methods for solving Ax = b consist in constructing a sequence of vectors (Xk),k = 1,... such that rk = b-AXk= Pk(A)r0, where Pk is the orthogonal polynomial of degree at most k with respect to the linear functional c defined as c(εi) = (y, Air0).
Farooq, M, Salhi, A
core  

Distributive and Dual Distributive Elements in Hyperlattices

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2017
In this paper we introduce and study distributive elements, dual distributive elements in hyperlattices, and prove that these elements forms ∧-semi lattice and ∨-semi hyperlattice, respectively.
Ameri Reza, Amiri-Bideshki M., Hoskova-Mayerova Sarka, Saeid A. B.   +3 more
doaj   +1 more source

Prime filters of hyperlattices

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016
The purpose of this paper is the study of prime ideals and prime filters in hyperlattices. I-filter and the filter generated by a ∈ L are introduced. Moreover, we introduce dual distributive hyperlattices, and I-filter in dual distributive hyperlattices.
Ameri Reza, Amiri-Bideshki M., Saeid Arsham Borumand, Hoskova-Mayerova Sarka   +3 more
doaj   +1 more source

Stability of linear GMRES convergence with respect to compact perturbations

, 2020
Suppose that a linear bounded operator $B$ on a Hilbert space exhibits at least linear GMRES convergence, i.e., there exists ...
Blechta, Jan
core  

Improved modified gradient-based iterative algorithm and its relaxed version for the complex conjugate and transpose Sylvester matrix equations

Demonstratio Mathematica
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

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  

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