相关论文: Solving the Selesnick-Burrus Filter Design Equatio…

This paper presents an efficient strategy for constructing Reduced-Order Model (ROM) bases using Taylor polynomial expansions and Fr{\'e}chet derivatives with respect to model parameters. The proposed approach enables the construction of…

In this paper we propose an idea of constructing a macro--scale matrix system given a micro--scale matrix linear system. Then the macro--scale system is solved at cheaper computing costs. The method uses the idea of the generalized…

We propose a branch-and-bound algorithm for minimizing a bilinear functional of the form \[ f(X,Y) = \mathrm{tr}((X\otimes Y)Q)+\mathrm{tr}(AX)+\mathrm{tr}(BY) , \] of pairs of Hermitian matrices $(X,Y)$ restricted by joint semidefinite…

Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triangulations, mesh processing and spatial relation tests. These algorithms have applications in scientific computing, geographic information…

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This…

This paper considers the problem of data-driven robust control design for nonlinear systems, for instance, obtained when discretizing nonlinear partial differential equations (PDEs). A robust learning control approach is developed for…

A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…

The combination of cell-free massive multiple-input multiple-output (CF-mMIMO) and reconfigurable intelligent surface (RIS) is envisioned as a promising paradigm to improve network capacity and enhance coverage capability. However, to reap…

Computational complexity of the brute-force implementation of the bilateral filter (BF) depends on its filter kernel size. To achieve the constant-time BF whose complexity is irrelevant to the kernel size, many techniques have been…

Methods are described for the solution of linear inference problems subject to deterministic constraints. The approach builds on work by Backus (1970a,b,c) and Parker (1977), but a range useful advances are suggested to address both…

One of the desirable objectives in feedback control design is to formulate and solve the design problem as an optimisation problem that is convex, so that an optimal solution can be found efficiently. Unfortunately many control design…

Starting from the results of Charles Fefferman and Janos Koll\`ar in Continuous Solutions of Linear Equations [1], we adopt a new approach based on Fefferman's techniques of Glaeser refinement to show a more general result than the one…

In this work, we propose a reduced basis method for efficient solution of parametric linear systems. The coefficient matrix is assumed to be a linear matrix-valued function that is symmetric and positive definite for admissible values of…

Strong algebraic proof systems such as IPS (Ideal Proof System; Grochow-Pitassi [GP18]) offer a general model for deriving polynomials in an ideal and refuting unsatisfiable propositional formulas, subsuming most standard propositional…

In this paper we consider efficient algorithms for solving the algebraic equation ${\mathcal A}^\alpha {\bf u}={\bf f}$, $0< \alpha <1$, where ${\mathcal A}$ is a symmetric and positive definite matrix obtained form finite difference or…

We consider ordered pairs $(X,\mathcal{B})$ where $X$ is a finite set of size $v$ and $\mathcal{B}$ is some collection of $k$-element subsets of $X$ such that every $t$-element subset of $X$ is contained in exactly $\lambda$ "blocks" $B\in…

This paper provides a survey of spherical designs and their applications, with a particular emphasis on the perspective of ``numerical analysis''. A set \(X_N\) of \(N\) points on the unit sphere \(\mathbb{S}^d\) is called a…

We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic…

We report a computational study of cutting plane algorithms for multi-stage stochastic mixed-integer programming models with the following cuts: (i) Benders', (ii) Integer L-shaped, and (iii) Lagrangian cuts. We first show that Integer…

In this contribution we present a new computational method for coupled bulk-surface problems on time-dependent domains. The method is based on a space-time formulation using discontinuous piecewise linear elements in time and continuous…