Block Triangular Form Research Articles

On the maximum dimensions of subalgebras of Mn(K) satisfying two related identities

For an arbitrary q≥2, we find an upper bound for the dimension of a subalgebra of the full matrix algebra Mn(K) over an arbitrary field K satisfying the identity[[x1,y1],z1]⋅[[x2,y2],z2]⋅⋯⋅[[xq,yq],zq]=0, and we show that this upper bound is sharp by presenting an example in block triangular form of a subalgebra of Mn(K) with dimension equal to the obtained upper bound. We apply this result to Lie solvable algebras of index 2, i.e., algebras satisfying the identity [[x1,y1],[x2,y2]]=0. To be precise, for n≤4, we find the sharp upper bound for the dimension of a Lie solvable subalgebra of Mn(K) of index 2, and for n>4, we obtain the relatively tight (at least for small values of n>4) interval[2+⌊3n28⌋,2+⌊5n212⌋] for the maximum dimension of a Lie solvable subalgebra of Mn(K) of index 2, the exact value of which is not known.

КОМП'ЮТЕРНИЙ РОЗВ'ЯЗОК МАТРИЧНИХ ЗАДАЧ

A feature of the computer solution of matrix problems is that often there is a problem of accumulation of rounding errors. This may lead to an incorrect result. J.H. Wilkinson developed efficient methods for finding eigenvalues and eigenvectors of matrices based on the well-known Francis-Kublanovska’s QR-algorithm. Now there are new problems of algebra, the methods of solution of which require further improvement. There is a problem of reducing a few initial matrices into a block-diagonal or block-triangular form. This requires the development of a new approaches to solving the problems of finding the centralizer of matrices and constructing an algebra with a unit generated by these matrices. For the first of these problems, it was possible to create an effective method. The next problem is to create an efficient algorithm for constructing the algebra generated by matrices

Existence and uniqueness of solutions for Leontief's Input–Output Model, graph theory and sensitivity analysis

We provide a complete study of existence and uniqueness (uniqueness up to multiples in the case d = 0 ) of non-negative and non-trivial solutions x for the linear system ( I − A ) x = d with A ≥ 0 , d ≥ 0 (which, in particular, applies to Leontief's Input–Output Model). This study is done in terms of the block triangular form of the matrix A and is related to a directed graph associated to A . In particular, this study of existence and uniqueness up to multiples of solutions provides a framework that allows us to rigorously perform a sensitivity analysis of the normalized solutions of the linear system ( I − A ) x = d .

Computing expected moments of the Rényi parking problem on the circle

A highly accurate and efficient method to compute the expected values of the count, sum, and squared norm of the sum of the centre vectors of a random maximal sized collection of non-overlapping unit diameter disks touching a fixed unit-diameter disk is presented. This extends earlier work on Renyi's parking problem [Magyar Tud. Akad. Mat. Kutato Int. Kozl. 3 (1–2), 1958, pp. 109–127]. Underlying the method is a splitting of the the problem conditional on the value of the first disk. This splitting is proven and then used to derive integral equations for the expectations. These equations take a lower block triangular form. They are solved using substitution and approximation of the integrals to very high accuracy using a polynomial approximation within the blocks.

On SDD1 Matrices

The paper continues the study of the recently introduced class of SDD1 matrices. The class of general SDD1 matrices and its three subclasses are considered. In particular, it is shown that SDD1 matrices are nonsingular ℌ-matrices. Also parameter-free upper bounds for the l∞-norm of the inverses to SDD1 matrices are derived. The block triangular form to which any SDD1 matrix can be brought by a symmetric permutation of its rows and columns is described.

On some aspects of spectral theory for infinite bounded non-negative matrices in max algebra

Several spectral radii formulas for infinite bounded non-negative matrices in max algebra are obtained. We also prove some Perron–Frobenius type results for such matrices. In particular, we obtain results on block triangular forms, which are similar to results on Frobenius normal form of matrices. Some continuity results are also established.

Algorithms for simultaneous block triangularization and block diagonalization of sets of matrices

<abstract><p>In a recent paper, a new method was proposed to find the common invariant subspaces of a set of matrices. This paper investigates the more general problem of putting a set of matrices into block triangular or block-diagonal form simultaneously. Based on common invariant subspaces, two algorithms for simultaneous block triangularization and block diagonalization of sets of matrices are presented. As an alternate approach for simultaneous block diagonalization of sets of matrices by an invertible matrix, a new algorithm is developed based on the generalized eigenvectors of a commuting matrix. Moreover, a new characterization for the simultaneous block diagonalization by an invertible matrix is provided. The algorithms are applied to concrete examples using the symbolic manipulation system Maple.</p></abstract>

Solving quasi-free and quadratic Lindblad master equations for open fermionic and bosonic systems

The dynamics of Markovian open quantum systems are described by Lindblad master equations. For fermionic and bosonic systems that are quasi-free, i.e. with Hamiltonians that are quadratic in the ladder operators and Lindblad operators that are linear in the ladder operators, we derive the equation of motion for the covariance matrix. This determines the evolution of Gaussian initial states and the steady states, which are also Gaussian. Using ladder super-operators (a.k.a. third quantization), we show how the Liouvillian can be transformed to a many-body Jordan normal form which also reveals the full many-body spectrum. Extending previous work by Prosen and Seligman, we treat fermionic and bosonic systems on equal footing with Majorana operators, shorten and complete some derivations, also address the odd-parity sector for fermions, give a criterion for the existence of bosonic steady states, cover non-diagonalizable Liouvillians also for bosons, and include quadratic systems. In extension of the quasi-free open systems, quadratic open systems comprise additional Hermitian Lindblad operators that are quadratic in the ladder operators. While Gaussian states may then evolve into non-Gaussian states, the Liouvillian can still be transformed to a useful block-triangular form, and the equations of motion for k-point Green’s functions form a closed hierarchy. Based on this formalism, results on criticality and dissipative phase transitions in such models are discussed in a companion paper.

Superoperator structures and no-go theorems for dissipative quantum phase transitions

In the thermodynamic limit, the steady states of open quantum many-body systems can undergo nonequilibrium phase transitions due to a competition between coherent and driven-dissipative dynamics. Here, we consider Markovian systems and elucidate structures of the Liouville superoperator that generates the time evolution. In many cases of interest, an operator-basis transformation can bring the Liouvillian into a block-triangular form, making it possible to assess its spectrum. The spectral gap sets the asymptotic decay rate. The superoperator structure can be used to bound gaps from below, showing that, in a large class of systems, dissipative phase transitions are actually impossible and that the convergence to steady states follows an exponential temporal decay. Furthermore, when the blocks on the diagonal are Hermitian, the Liouvillian spectra obey Weyl ordering relations. The results apply, for example, to Davies generators and quadratic systems and are also demonstrated for various spin models.

Observer-based Multirate Feedback Control Design for Two-time-scale System

The use of a lower sampling rate for designing a discrete-time state feedback-based controller fails to capture information of fast states in a two-time-scale system, while the use of a higher sampling rate increases the amount of computation considerably. Thus, the use of single-rate sampling for systems with slow and fast states has evident limitations. In this paper, multirate state feedback (MRSF) control for a linear time-invariant two-time-scale system is proposed. Here, multirate sampling refers to the sampling of slow and fast states at different sampling rates. Firstly, a block-triangular form of the original continuous two-time-scale system is constructed. Then, it is discretized with a smaller sampling period and feedback control is designed for the fast subsystem. Later, the system is block-diagonalized and equivalently represented into a system with a higher sampling period. Subsequently, feedback control is designed for the slow subsystem and overall MRSF control is derived. It is proved that the derived MRSF control stabilizes the full-order system. Being the transformed states of the original system, slow and fast states need to be estimated for the MRSF control realization. Hence, a sequential two-stage observer is formulated to estimate these states. Finally, the applicability of the design method is demonstrated with a numerical example and simulation results are compared with the single-rate sampling method. It is found that the proposed MRSF control and observer designs reduce computations without compromising closed-loop performance.

A New Block Structural Index Reduction Approach for Large-Scale Differential Algebraic Equations

A new generation of universal tools and languages for modeling and simulation multi-physical domain applications has emerged and became widely accepted; they generate large-scale systems of differential algebraic equations (DAEs) automatically. Motivated by the characteristics of DAE systems with large dimensions, high index or block structures, we first propose a modified Pantelides’ algorithm (MPA) for any high order DAEs based on the Σ matrix, which is similar to Pryce’s Σ method. By introducing a vital parameter vector, a modified Pantelides’ algorithm with parameters has been presented. It leads to a block Pantelides’ algorithm (BPA) naturally which can immediately compute the crucial canonical offsets for whole (coupled) systems with block-triangular form. We illustrate these algorithms by some examples, and preliminary numerical experiments show that the time complexity of BPA can be reduced by at least O(ℓ) compared to the MPA, which is mainly consistent with the results of our analysis.

Complete reduction of integrals in two-loop five-light-parton scattering amplitudes * * Supported in part by the National Natural Science Foundation of China (11875071, 11975029) and the High-performance Computing Platform of Peking University

We reduce all the most complicated Feynman integrals in two-loop five-light-parton scattering amplitudes to basic master integrals, while other integrals can be reduced even easier. Our results are expressed as systems of linear relations in the block-triangular form, very efficient for numerical calculations. Our results are crucial for complete next-to-next-to-leading order quantum chromodynamics calculations for three-jet, photon, and/or hadron production at hadron colliders. To determine the block-triangular relations, we develop an efficient and general method, which may provide a practical solution to the bottleneck problem of reducing multiloop multiscale integrals.

Dynamic Coarsening and Local Reordered Nonlinear Solvers for Simulating Transport in Porous Media

Summary We present a robust and flexible sequential solution approach in which the flow equation is solved on the original grid, whereas the transport equations are solved with a new dynamic coarsening method that adapts the grid resolution locally to reduce the number of cells as much as possible. The resulting grid is formed by combining precomputed coarse partitions of an underlying fine model. Our approach is flexible and makes very few assumptions on cell geometries and the topology of the grid. To further accelerate the transport step, we combine dynamic coarsening with a local nonlinear solver that permutes the discrete transport equations into an optimal block-triangular form so that these can be solved very efficiently using a nonlinear back-substitution method. Efficiency and utility of the overall approach are assessed through a number of conceptual test cases, including the Olympus field model.

Cyclic covers and Ihara’s question

Let $\ell$ be a rational prime and $k$ a number field. Given a superelliptic curve $C/k$ of $\ell$-power degree, we describe the field generated by the $\ell$-power torsion of the Jacobian variety in terms of the branch set and reduction type of $C$ (and hence, in terms of data determined by a suitable affine model of $C$). If the Jacobian is good away from $\ell$ and the branch set is defined over a pro-$\ell$ extension of $k(\mu_{\ell^\infty})$ unramified away from $\ell$, then the $\ell$-power torsion of the Jacobian is rational over the maximal such extension. By decomposing the covering into a chain of successive cyclic $\ell$-coverings, the mod $\ell$ Galois representation attached to the Jacobian is decomposed into a block triangular form. The blocks on the diagonal of this form are further decomposed in terms of the Tate twists of certain subgroups $W_s$ of the quotients of the Jacobians of successive coverings. The result is a natural extension of earlier work by Anderson and Ihara, who demonstrated that a stricter condition on the branch locus guarantees the $\ell$-power torsion of the Jacobian is rational over the fixed field of the kernel of the canonical pro-$\ell$ outer Galois representation attached to an open subset of $\mathbf{P}^1$.

ВСЕГДА НЕВЫРОЖДЕННЫЕ МНОГОЧЛЕНЫ ОТ ДВУХ ПРОЕКТОРОВ

This paper discusses the polynomials of two projectors that with any selection of these projectors have the value of the nonsingular matrix. Results of work [1] about block-triangular form pair of projectors apply to deduce equations, that the coecients of always nonsingular polynomials satisfy to. From the equations is obtained the main result, namely always nonsigular polynomial can be decomposed into a product of special polynomials. Special polynomial of two projectors P; Q is a linear binomial I + P; I + Q, or a polynomial like this I + x1(PQP PQ) + x2(PQPQP PQPQ) + ::: . It is proved that special polynomials are irreducible. It turns out that linear binomials can be rearranged with some other special polynomials. If in a product of special polynomials the linear binomials are rearranged as much as possible to the left, you will get a product of special polynomials, called standard. It is proved that the standard form of product by special polynomials is unigue. The obtained results have provided a description of the structure of all polynomials of two projectors that with any selection of these projectors are nilpotent matrices (nilpotent polynomials). Similar results were obtained for the involute polynomials and polynomialsprojectors.

The Best Reduction of Matrices to Block-Triangular Form for Hierarchical Decomposition Problems

The author solves the problem of reducing several complex (generally speaking) n×n matrices to the same block-triangular form with a maximum possible number of blocks on the main diagonal with the use of a similarity transformation. The obtained solution may be used to apply the methods of hierarchical decomposition in the analysis of complex systems.

Structural analysis based dummy derivative selection for differential algebraic equations

The signature matrix structural analysis method developed by Pryce provides more structural information than the commonly used Pantelides method and applies to differential-algebraic equations (DAEs) of arbitrary order. It is useful to consider how existing methods using the Pantelides algorithm can benefit from such structural analysis. The dummy derivative method is a technique commonly used to solve DAEs that can benefit from such exploitation of underlying DAE structures and information found in the Signature Matrix method. This paper gives a technique to find structurally necessary dummy derivatives and how to use different block triangular forms effectively when performing the dummy derivative method and then provides a brief complexity analysis of the proposed approach. We finish by outlining an approach that can simplify the task of dummy pivoting.

Computing the Jordan Structure of an Eigenvalue

In this paper we revisit the problem of finding an orthogonal similarity transformation that puts an $n\times n$ matrix $A$ in a block upper-triangular form that reveals its Jordan structure at a particular eigenvalue $\lambda_0$. The obtained form in fact reveals the dimensions of the null spaces of $(A-\lambda_0 I)^i$ at that eigenvalue via the sizes of the leading diagonal blocks, and from this the Jordan structure at $\lambda_0$ is then easily recovered. The method starts from a Hessenberg form that already reveals several properties of the Jordan structure of $A$. It then updates the Hessenberg form in an efficient way to transform it to a block-triangular form in ${\cal O}(mn^2)$ floating point operations, where $m$ is the total multiplicity of the eigenvalue. The method only uses orthogonal transformations and is backward stable. We illustrate the method with a number of numerical examples.

Adaptive NN Control Using Integral Barrier Lyapunov Functionals for Uncertain Nonlinear Block-Triangular Constraint Systems.

A neural network (NN) adaptive control design problem is addressed for a class of uncertain multi-input-multi-output (MIMO) nonlinear systems in block-triangular form. The considered systems contain uncertainty dynamics and their states are enforced to subject to bounded constraints as well as the couplings among various inputs and outputs are inserted in each subsystem. To stabilize this class of systems, a novel adaptive control strategy is constructively framed by using the backstepping design technique and NNs. The novel integral barrier Lyapunov functionals (BLFs) are employed to overcome the violation of the full state constraints. The proposed strategy can not only guarantee the boundedness of the closed-loop system and the outputs are driven to follow the reference signals, but also can ensure all the states to remain in the predefined compact sets. Moreover, the transformed constraints on the errors are used in the previous BLF, and accordingly it is required to determine clearly the bounds of the virtual controllers. Thus, it can relax the conservative limitations in the traditional BLF-based controls for the full state constraints. This conservatism can be solved in this paper and it is for the first time to control this class of MIMO systems with the full state constraints. The performance of the proposed control strategy can be verified through a simulation example.

The transfer function of generic linear quantum stochastic systems has a pure cascade realization

This paper establishes that generic linear quantum stochastic systems have a pure cascade realization of their transfer function, generalizing an earlier result established only for the special class of completely passive linear quantum stochastic systems. In particular, a cascade realization therefore exists for generic active linear quantum stochastic systems that require an external source of quanta to operate. The results facilitate a simplified realization of generic linear quantum stochastic systems for applications such as coherent feedback control and optical filtering. The key tools that are developed are algorithms for symplectic QR and Schur decompositions. It is shown that generic real square matrices of even dimension can be transformed into a lower 2×2 block triangular form by a symplectic similarity transformation. The linear algebraic results herein may be of independent interest for applications beyond the problem of transfer function realization for quantum systems. Numerical examples are included to illustrate the main results. In particular, one example describes an equivalent realization of the transfer function of a nondegenerate parametric amplifier as the cascade interconnection of two degenerate parametric amplifiers with an additional outcoupling mirror.