scispace - formally typeset
Search or ask a question
Topic

Square matrix

About: Square matrix is a research topic. Over the lifetime, 5000 publications have been published within this topic receiving 92428 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this paper, a generalized centro-symmetric solution pair of generalized coupled Sylvester matrix equations (GCSY) is computed using the conjugate gradient method.

126 citations

01 Jan 1999
TL;DR: The SPOOLES software package provides a choice of three sparse matrix orderings (minimum degree, nested dissection and multisection), supports pivoting for numerical stability, can compute direct or drop tolerance factorizations, and the computations are based on BLAS3 numerical kernels to take advantage of high performance computing architectures.
Abstract: 1 Overview Solving sparse linear systems of equations is a common and important component of a multitude of scientific and engineering applications. The SPOOLES software package1 provides this functionality with a collection of software objects and methods. The package provides a choice of three sparse matrix orderings (minimum degree, nested dissection and multisection), supports pivoting for numerical stability (when required), can compute direct or drop tolerance factorizations, and the computations are based on BLAS3 numerical kernels to take advantage of high performance computing architectures. The factorizations and solves are supported in serial, multithreaded (using POSIX threads) and MPI environments. The first step to solving a linear system AX = B is to construct “objects” to hold the entries and structure of A, and the entries of X and B. SPOOLES provides a flexible set of methods to assemble a sparse matrix. The “input matrix” object allows a choice of coordinate systems (by rows, by columns, and other ways), flexible input (input by single entries, (partial) rows or columns, dense submatrices, or any combination), resizes itself as necessary, and assembles, sorts and permutes its entries. It is also a distributed object for MPI environments. Matrix entries can be created and assembled on different processors, and methods exist to assemble and redistribute the matrix entries as necessary. There are three methods to order a sparse matrix: minimum degree, generalized nested dissection and multisection. The latter two orderings depend on a domain/separator tree that is constructed using a graph partitioning method. Domain decomposition is used to find an initial separator, and a sequence of network flow problems are solved to smooth the separator. The qualities of our nested dissection and multisection orderings are comparable to other state of the art packages. Factorizations of square matrices have the form A = PLDUQ and A = PLDLP T , where P and Q are permutation matrices. Square systems of the form A + σB may also be factored and solved (as found in shift-and-invert eigensolvers), as well as full rank overdetermined linear systems, where a QR factorization is computed and the solution found by solving the semi-normal equations.

124 citations

Journal ArticleDOI
TL;DR: A method of analysis is proposed which produces a set of first-order differential equations which can be expressed in the form F + dy/dt = Ay , where F and y are column matrices and A is a square matrix.
Abstract: Both the loop and node methods of network analysis produce a system of second-order differential equations. A method of analysis is proposed which produces a set of first-order differential equations. With this method, the network equations obtained can be expressed in the form F + dy/dt = Ay , where F and y are column matrices and A is a square matrix. The variables, y , are currents through inductances and voltages across capacitances; the forcing functions. F are proportional to voltage and current sources. The elements of A are inductances, capacitances, and resistances, or combinations thereof. Characteristic roots (natural frequencies) of the network are identical with the eigenvalues of the A matrix.

122 citations

Journal ArticleDOI
TL;DR: It is proved that a matrix satisfies its two-dimensional characteristic function, and this property is used to form a diagnostic matrix, which is used in a minimization technique.
Abstract: A model for two-dimensional linear iterative circuits is defined in the form of matrix equations. From the matrix equations, a two-dimensional characteristic function is defined. It is then proved that a matrix satisfies its two-dimensional characteristic function. This property is used to form a diagnostic matrix. Finally, the diagnostic matrix is used in a minimization technique.

121 citations


Network Information
Related Topics (5)
Matrix (mathematics)
105.5K papers, 1.9M citations
84% related
Polynomial
52.6K papers, 853.1K citations
84% related
Eigenvalues and eigenvectors
51.7K papers, 1.1M citations
81% related
Bounded function
77.2K papers, 1.3M citations
80% related
Hilbert space
29.7K papers, 637K citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202322
202244
2021115
2020149
2019134
2018145