Results 51 to 60 of about 24,845 (203)
Linear Algebra and its Applications, 1979 AbstractLet A be an n×n complex matrix. For a suitable subspace M of Cn the Schur compression A M and the (generalized) Schur complement A/M are defined. If A is written in the form A= BCST according to the decomposition Cn=M⊕M⊥ and if B is invertible, then AM=BCSSB−1C and A/M=000T−SB−1C· The commutativity rule for Schur complements is proved: (A/M)/N=(
openaire +1 more source
Some Results on the Drazin Inverse of a Modified Matrix with New Conditions
International Journal of Analysis and Applications, 2014 In this article, we consider representations of the Drazin inverse of a modified matrix M = A−CDdB with the generalized Schur complement Z = D − BAdC under different conditions given in recent articles on the subject.
Abdul Shakoor, Hu Yang, Ilyas Ali
doaj +2 more sources
An Application of the Schur Complement to Truncated Matricial Power Moment Problems
, 2017 The main goal of this paper is to reconsider a phenomenon which was treated in earlier work of the authors' on several truncated matricial moment problems.
Fritzsche, Bernd +2 more
core +1 more source
Pinning synchronization of the drive and response dynamical networks with lag
Archives of Control Sciences, 2014 This paper investigates the pinning synchronization of two general complex dynamical networks with lag. The coupling configuration matrices in the two networks are not need to be symmetric or irreducible.
Wen Bohui, Zhao Mo, Meng Fanyu
doaj +1 more source
Schur Complement-Based Infinity Norm Bound for the Inverse of Dashnic-Zusmanovich Type Matrices
Mathematics, 2023 It is necessary to explore more accurate estimates of the infinity norm of the inverse of a matrix in both theoretical analysis and practical applications.
Wenlong Zeng, Jianzhou Liu, Hongmin Mo
doaj +1 more source
Sweeping Preconditioner for the Helmholtz Equation: Moving Perfectly Matched Layers [PDF]
, 2010 This paper introduces a new sweeping preconditioner for the iterative solution of the variable coefficient Helmholtz equation in two and three dimensions. The algorithms follow the general structure of constructing an approximate $LDL^t$ factorization by
Engquist, Björn, Ying, Lexing
core
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT This paper is concerned with the platooning control problem of connected automated vehicles (CAVs) under non‐uniform stochastic vehicle‐to‐vehicle (V2V) communication delays. Most existing relevant studies assume uniform or deterministic or slowly varying delays, or design platoon controllers based on worst‐case delay bounds, resulting in ...
Dengfeng Pan +3 more
wiley +1 more source
Initial State Privacy of Nonlinear Systems on Riemannian Manifolds
International Journal of Robust and Nonlinear Control, EarlyView.ABSTRACT In this paper, we investigate initial state privacy protection for discrete‐time nonlinear closed systems. By capturing Riemannian geometric structures inherent in such privacy challenges, we refine the concept of differential privacy through the introduction of an initial state adjacency set based on Riemannian distances.
Le Liu, Yu Kawano, Antai Xie, Ming Cao
wiley +1 more source
Schur Complement Optimized Iterative EKF for Visual–Inertial Odometry in Autonomous Vehicles
MachinesAccuracy and nonlinear processing capabilities are critical to the positioning and navigation of autonomous vehicles in visual–inertial odometry (VIO).
Guo Ma +6 more
doaj +1 more source
Sampling Random Spanning Trees Faster than Matrix Multiplication
, 2017 We present an algorithm that, with high probability, generates a random spanning tree from an edge-weighted undirected graph in $\tilde{O}(n^{4/3}m^{1/2}+n^{2})$ time (The $\tilde{O}(\cdot)$ notation hides $\operatorname{polylog}(n)$ factors).
Durfee, David +4 more
core +1 more source