Results 41 to 50 of about 567 (182)

Representations for the Drazin inverse of the generalized Schur complement

, 2013
In this paper we present expressions for the Drazin inverse of the generalized Schur complement $A-CD^{d}B$ in terms of the Drazin inverses of $A$ and the generalized Schur complement $D-BA^{d}C$ under less and weaker restrictions, which generalize several results in the literature and the formula of Sherman-Morrison-Woodbury type.
Zhang, Daochang, Du, Xiankun
openaire   +2 more sources

parGeMSLR: A parallel multilevel Schur complement low-rank preconditioning and solution package for general sparse matrices

Parallel Computing, 2022
This paper discusses parGeMSLR, a C++/MPI software library for the solution of sparse systems of linear algebraic equations via preconditioned Krylov subspace methods in distributed-memory computing environments. The preconditioner implemented in parGeMSLR is based on algebraic domain decomposition and partitions the symmetrized adjacency graph ...
Tianshi Xu, Vassilis Kalantzis, Ruipeng Li, Yuanzhe Xi, Geoffrey Dillon, Yousef Saad   +5 more
openaire   +2 more sources

Mitigating Disability Bias in Hiring: The Role of Inclusion‐Focused Generative AI in Complex HR Decisions

Human Resource Management Journal, EarlyView.
ABSTRACT This research investigates how inclusion‐focused generative AI (GAI), designed with diversity, fairness, and inclusion principles, mitigates disability bias in hiring—particularly under complex, cognitively demanding conditions. Drawing on Construal Level Theory, two experiments with HR professionals (N = 117; 238) compared standard, inclusion‐
Miles M. Yang
wiley   +1 more source

Schur complements and statistics

, 1981
In this paper we discuss various properties of matrices of the type S=H−GE−1F, which we call the Schur complement of E in A = EFGH The matrix E is assumed to be nonsingular.
Ouellette, Diane Valérie
core   +1 more source

Mixed Super‐Circles

Computer Graphics Forum, EarlyView.
Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel, Thibaut Métivet, Florence Bertails‐Descoubes   +2 more
wiley   +1 more source

Trade and Selection With Heterogeneous Firms and Perfect Competition

Review of International Economics, EarlyView.
ABSTRACT This paper extends the Heckscher–Ohlin–Samuelson framework to allow for heterogeneous firms with capacity constraints. We show that the central theorems of the HOS model (as well as their standard generalizations via duality) carry over to our setting.
Xue Bai, Arpita Chatterjee, Kala Krishna, Hong Ma   +3 more
wiley   +1 more source

Chebyshev Smoothing With Adaptive Block‐FSAI Preconditioners for the Multilevel Solution of Higher‐Order Problems With the Partition of Unity Method

Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.
ABSTRACT In this paper, we assess the performance of adaptive and nested factorized sparse approximate inverses as smoothers in multilevel V‐cycles, when smoothing is performed following the Chebyshev iteration of the fourth kind, for the efficient solution of linear systems arising from a conforming discretization of higher‐order partial differential ...
Pablo Jiménez Recio, Marc Alexander Schweitzer   +1 more
wiley   +1 more source

A New Observer Design for the Joint Estimation of States and Unknown Inputs for a Class of Nonlinear Fractional-Order Systems

Mathematics
This article designs an observer for the joint estimation of the state and the unknown input for a class of nonlinear fractional-order systems (FOSs) such that one portion satisfies the Lipschitz condition and the other does not necessarily satisfy such ...
Chenchen Peng, Haiyi Yang, Anqing Yang, Ling Ren   +3 more
doaj   +1 more source

An Augmented Lagrangian Preconditioner for Navier–Stokes Equations With Runge–Kutta in Time

Numerical Linear Algebra with Applications, Volume 33, Issue 3, June 2026.
ABSTRACT We consider an implicit Runge–Kutta method for the numerical time integration of the nonstationary incompressible Navier–Stokes equations. This yields a sequence of nonlinear problems to be solved for the stages of the Runge–Kutta method. The resulting nonlinear system of differential equations is discretized using a finite element method.
Santolo Leveque, Yunhui He, Maxim Olshanskii   +2 more
wiley   +1 more source

Fast iterative solvers for PDE-constrained optimization problems

, 2013
In this thesis, we develop preconditioned iterative methods for the solution of matrix systems arising from PDE-constrained optimization problems. In order to do this, we exploit saddle point theory, as this is the form of the matrix systems we wish to ...
Pearson, John W
core   +1 more source