Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 23 for “"M-matrices"”.
-
M-matrices, chebyshev polynomials and applications for finite difference schemes /
This study develops a framework that combines $M$-matrix theory and Chebyshev polynomials to improve the stability and accuracy of finite difference methods. We use key $M$-matrix traits invertibility, non-positive off-diagonals, and diagonal dominance to ensure stable discretizations that converge …
-
A stable method for the LU-decomposition of M-matrices
… an algorithm for the LU-decomposition of M-matrices based upon Gaussian Elimination applied with a new pivoting strategy. At each step of the elimination, the pivoting strategy selects a column that is the most (column) diagonally dominant in the unreduced submatrix and exchanges it into …
-
Analysis and Numerical Methods for Algebraic Riccati Equations Associated with Regular M-Matrices
… Riccati equations for which the four coe cient matrices form a regular M-matrix K. We prove a property about minimal nonnegative solutions of such an algebraic Riccati equation and its dual equation. And we show that Newton's method, SDA, ADDA are well-de ned and quadratically convergent in …
-
Studies on quadratic matrix equations and riccati differential equations associated with regular m-matrices
… Riccati equation for which the four coe cient matrices form a regular M-matrix. We also discuss the initial value problem for a matrix Riccati di erential equation associated with a regular M-matrix. We show that for suitable initial matrices X0, the initial value problem has a global solution …
-
An Application of M-matrices to Preserve Bounded Positive Solutions to the Evolution Equations of Biofilm Models
… technique is established using the theory of M-matrices, which are nonsingular matrices where all the entries of their inverses are positive numbers. We provide numerical simulations to evince the preservation of the nonnegative character of solutions under homogeneous Dirichlet and Neumann …
-
Positive-off-diagonal Operators on Ordered Normed Spaces and Maximum Principles for M-Operators
M-matrices are extensively employed in numerical analysis. These matrices can be generalized by corresponding operators on a partially ordered normed space. We extend results which are well-known for M-matrices to this more general setting. We investigate two different notions of an M-operator, …
-
An Abstract Matrix Model: The Column Model
… of an m-by-m matrix. Since the set of m-by-m matrices belongs to the special class of partially ordered linear algebras satisfying the conditions of the Model, the results obtained hold for the set of m-by-m matrices.
-
Generalizing smoothed aggregation-based algebraic multigrid
… strength measure is only well-founded for M-matrices, leading us to develop a new measure based on local knowledge of both algebraically smooth error and the behavior of interpolation. Another limitation is that classic SA is only formally defined for Hermitian positive definite problems. For …
-
Shifted Eisenstein polynomials, irreducible compositions of polynomials and group key exchanges
… this and consider the density of k × m matrices over holomorphy rings which can be extended to unimodular m × m matrices. In the second part, we determine the natural density of shifted Eisenstein polynomials. This means that we compute the density of integer polynomials f(x) of a fixed …
-
Extensions of Perron-Frobenius Theory
… Oscar Perron in 1907 with a result on positive matrices and Georg Frobenius in 1912, who extended that result to the case of irreducible nonnegative matrices. An Mv-matrix is a matrix of the form A=sI−B, where 0≤ρ(B)≤s and B is an eventually nonnegative matrix. A GM-matrix denotes a matrix of …
-
Interpolation weights of algebraic multigrid
… setup phase costs. We present systems involving matrices where this iterative method significantly outperforms regular AMG weight definitions. Experimental results show that the iterative weight definition does not improve the convergence rate over standard AMG when applied to M-matrices; …
-
Stability criteria for multi-species ecological communities
… mathematical developments in the theory of M-matrices.</p><p>The stability conditions presented are necessary and sufficient for the stability of mutualistic communities, a class that has not been considered in the ecological literature previously. These conditions are also sufficient for …
-
Universal completions of the cyclic amalgams of the same type
… p. Then Aut(G) is isomorphic to the set of m×m matrices with determinant coprime to p, GL\(_m\) (e\(_q\)) Also Aut(G)=p\(^{(n-1)}\) \(^{(m2)}\) GL\(_m\) (Z\(_q\)). If \(\alpha\)is an automorphism of S\(_n\)and t is a transposition of S\(_n\)for n \(\not\) 6, then \(\alpha\)(t)is a transposition. …
-
Algunos resultados sobre B-matrices y matrices con inversa positiva
… desde diferentes puntos de vista, dos clases de matrices ampliamente utilizadas, las matrices con inversa positiva y las B-matrices. Vamos a generalizar, en unos casos, y completar en otros los resultados obtenidos por diferentes investigadores. El problema de caracterizar matrices …
-
Support graph preconditioning for elliptic finite element problems
… is applicable to symmetric diagonally dominant matrices only. This work presents a technique that can be used to transform the symmetric positive definite matrices arising from elliptic finite element problems into symmetric diagonally dominant M-matrices. The basic idea is to approximate the …
-
Algebraic Multigrid for Markov Chains and Tensor Decomposition
… the class of nonsymmetric irreducible singular M-matrices with zero column sums. Acceleration schemes based on fine-level iterant recombination, and over-correction of the coarse-grid correction are developed to improve the rate of convergence and scalability of simple adaptive aggregation …
-
A neural network approach for the solution of Traveling Salesman and basic vehicle routing problems
… of the original elastic net method two nx m matrices of connection weights and inter node-city distances must be calculated. In our hybrid method this has been reduced to the calculation of one row and one column of each matrix, thus, If the computational complexity of the elastic net is O(n …
-
Rank modification method for certain singular systems of linear equations
… Also investigated are tridiagonal irreducible M-matrices.</p> <p>These methods are applied to the problem of computing the stationary distribution vector p of an ergodic finite Markov chain C with associated rate transition matrix Q. Computational results for several test problems are reported, …
Page 1 of 2