Related papers: Hypergeometric Solutions of Linear Difference Syst…
The improvement in observational facilities requires refining the modelling of the geometrical structures of astrophysical objects. Nevertheless, for complex problems such as line overlap in molecules showing hyperfine structure, a detailed…
We deduce a procedure to apply balanced truncation to parameter-dependent differential-algebraic systems. For that we solve multiple projected Lyapunov equations for different parameter values to compute the Gramians that are required for…
An algorithm for extracting identity submatrices of small rank and pivotal units from large and sparse matrices is proposed. The procedure has already been satisfactorily applied for solving the label switching problem in Bayesian mixture…
Due to the wide range of timescales that are present in macromolecular systems, hierarchical multiscale strategies are necessary for their computational study. Coarse-graining (CG) allows to establish a link between different system…
We present a successive constraint approach that makes it possible to cheaply solve large-scale linear matrix inequalities for a large number of parameter values. The efficiency of our method is made possible by an offline/online…
We develop an accelerated gradient descent algorithm on the Grassmann manifold to compute the subspace spanned by a number of leading eigenvectors of a symmetric positive semi-definite matrix. This has a constant cost per iteration and a…
We develop and analyze methods for computing provably optimal {\em maximum a posteriori} (MAP) configurations for a subclass of Markov random fields defined on graphs with cycles. By decomposing the original distribution into a convex…
A natural and important generalization of submodularity -- $k$-submodularity -- applies to set functions with $k$ arguments and appears in a broad range of applications, such as infrastructure design, machine learning, and healthcare. In…
In this paper, a proximal augmented Lagrangian homotopy (PAL-Hom) method for solving convex quadratic programming problems is proposed. This method takes the proximal augmented Lagrangian method as the outer iteration. To solve the proximal…
We give a new method to prove in a uniform and easy way various transformation formulas for Gauss hypergeometric functions. The key is Jacobi's canonical form of the hypergeometric differential equation. Analogy for $q$-hypergeometric…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
This paper proposes a method for detecting multiple scatterers (targets) in the elevation direction for synthetic aperture radar (SAR) tomography. The proposed method can resolve closely spaced targets through a twostep procedure. In the…
This paper addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This…
This paper presents a generalization of our earlier work in [19]. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) variety introduced in [19] for generic zero-dimensional systems,…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
We consider continuous linear programs over a continuous finite time horizon $T$, with a constant coefficient matrix, linear right hand side functions and linear cost coefficient functions, where we search for optimal solutions in the space…
A solution to the effectiveness problem in Kohn's algorithm for generating subelliptic multipliers is provided for domains that include those given by sums of squares of holomorphic functions (also including infinite sums). These domains…
We introduce new techniques for calculations in Gauge theories with extended supersymmetry. We are working in Projective Superspace where the $SU(2)$ R-symmetry is realized geometrically by including an auxilliary $\mathbb{CP}^1$ component…
Holographic algorithms introduced by Valiant are composed of two ingredients: matchgates, which are gadgets realizing local constraint functions by weighted planar perfect matchings, and holographic reductions, which show equivalences among…
We present a class of reduced basis (RB) methods for the iterative solution of parametrized symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin projection of the underlying parametrized system onto a…