Related papers: A modified large-scale structure-preserving doubli…
Motivated by Pryce's structural index reduction method for differential algebraic equations (DAEs), we show the complexity of the fixed-point iteration algorithm and propose a fixed-point iteration method with parameters. It leads to a…
We engineer algorithms for sorting huge data sets on massively parallel machines. The algorithms are based on the multiway merging paradigm. We first outline an algorithm whose I/O requirement is close to a lower bound. Thus, in contrast to…
In this paper we discuss how to decompose the constrained generalized discrete-time algebraic Riccati equation arising in optimal control and optimal filtering problems into two parts corresponding to an additive decomposition X=X0+D of…
We present a primal--dual memory efficient algorithm for solving a relaxed version of the general transportation problem. Our approach approximates the original cost function with a differentiable one that is solved as a sequence of…
In this paper, we established a quadratic transportation cost inequality for scalar stochastic conservation laws driven by multiplicative noise. The doubling variables method plays an important role.
The latent Dirichlet allocation (LDA) model is a widely-used latent variable model in machine learning for text analysis. Inference for this model typically involves a single-site collapsed Gibbs sampling step for latent variables…
Solving large-scale continuous-time algebraic Riccati equations is a significant challenge in various control theory applications. This work demonstrates that when the matrix coefficients of the equation are quasiseparable, the solution…
This paper is concerned with the convergence of a two-step modified Newton method for solving the nonlinear system arising from the minimal nonnegative solution of nonsymmetric algebraic Riccati equations from neutron transport theory. We…
We present several second-order linear differential equations that are associated to a particular Riccati equation with only one constant parameter in its coefficients through the technique of supersymmetric factorizations and through a…
We consider a class of sparsity-inducing optimization problems whose constraint set is regularizer-compatible, in the sense that, the constraint set becomes easy-to-project-onto after a coordinate transformation induced by the…
This paper is devoted to a structured perturbation analysis of the symmetric algebraic Riccati equations by exploiting the symmetry structure. Based on the analysis, the upper bounds for the structured normwise, mixed and componentwise…
Network reconstruction consists in determining the unobserved pairwise couplings between $N$ nodes given only observational data on the resulting behavior that is conditioned on those couplings -- typically a time-series or independent…
Regularized linear discriminant analysis (RLDA) is a widely used tool for classification and dimensionality reduction, but its performance in high-dimensional scenarios is inconsistent. Existing theoretical analyses of RLDA often lack clear…
We study robust PCA for the fully observed setting, which is about separating a low rank matrix $\boldsymbol{L}$ and a sparse matrix $\boldsymbol{S}$ from their sum $\boldsymbol{D}=\boldsymbol{L}+\boldsymbol{S}$. In this paper, a new…
Scalar multiplication kP is a critical operation in Elliptic Curve Cryptosystems (ECC), often targeted by Side-Channel Analysis (SCA). Despite strategies based on atomic patterns to enhance security, the binary kP algorithms remain…
In distributed storage systems built using commodity hardware, it is necessary to have data redundancy in order to ensure system reliability. In such systems, it is also often desirable to be able to quickly repair storage nodes that fail.…
Variables in many massive high-dimensional data sets are structured, arising for example from measurements on a regular grid as in imaging and time series or from spatial-temporal measurements as in climate studies. Classical multivariate…
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric…
We consider approximations to the solutions of differential Riccati equations in the context of linear quadratic regulator problems, where the state equation is governed by a multiscale operator. Similarly to elliptic and parabolic…
This article studies two particular algorithms, a Relaxation Least Squares (RLS) algorithm and a Relaxation Newton Iteration (RNI) scheme , for reconstructing unknown parameters in dissipative dynamical systems. Both algorithms are based on…