L2 optimal model reduction

This paper deals with the problem of computing an L2-optimal reduced-order model for a given stable multivariable linear system. By way of orthogonal projection, the problem is formulated as that of minimizing the L2 model reduction cost over the Stiefel manifold so that the stability constraint on reduced-order models is automatically satisfied and thus totally avoided in the new problem formulation. The closed form formula for the gradient of the cost over the manifold is derived, from which a gradient flow is formed as an ordinary differential equation. A number of nice properties about such a flow are obtained. Among them are the decreasing property of the cost along the ODE solution and the convergence of the flow from any starting point in the manifold. Furthermore, an explicit iterative convergent algorithm is developed from the flow and inherits the properties that the iterates remain on the manifold starting from any orthogonal initial point and that the model-reduction cost is decreasing to minimums along the iterates.published_or_final_versio

Density Matrix Renormalization for Model Reduction in Nonlinear Dynamics

We present a novel approach for model reduction of nonlinear dynamical systems based on proper orthogonal decomposition (POD). Our method, derived from Density Matrix Renormalization Group (DMRG), provides a significant reduction in computational effort for the calculation of the reduced system, compared to a POD. The efficiency of the algorithm is tested on the one dimensional Burgers equations and a one dimensional equation of the Fisher type as nonlinear model systems.Comment: 12 pages, 12 figure

Randomized Local Model Order Reduction

In this paper we propose local approximation spaces for localized model order reduction procedures such as domain decomposition and multiscale methods. Those spaces are constructed from local solutions of the partial differential equation (PDE) with random boundary conditions, yield an approximation that converges provably at a nearly optimal rate, and can be generated at close to optimal computational complexity. In many localized model order reduction approaches like the generalized finite element method, static condensation procedures, and the multiscale finite element method local approximation spaces can be constructed by approximating the range of a suitably defined transfer operator that acts on the space of local solutions of the PDE. Optimal local approximation spaces that yield in general an exponentially convergent approximation are given by the left singular vectors of this transfer operator [I. Babu\v{s}ka and R. Lipton 2011, K. Smetana and A. T. Patera 2016]. However, the direct calculation of these singular vectors is computationally very expensive. In this paper, we propose an adaptive randomized algorithm based on methods from randomized linear algebra [N. Halko et al. 2011], which constructs a local reduced space approximating the range of the transfer operator and thus the optimal local approximation spaces. The adaptive algorithm relies on a probabilistic a posteriori error estimator for which we prove that it is both efficient and reliable with high probability. Several numerical experiments confirm the theoretical findings.Comment: 31 pages, 14 figures, 1 table, 1 algorith

A Logical Approach to Efficient Max-SAT solving

Weighted Max-SAT is the optimization version of SAT and many important problems can be naturally encoded as such. Solving weighted Max-SAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in finding efficient solving techniques. Most of this work focus on the computation of good quality lower bounds to be used within a branch and bound DPLL-like algorithm. Most often, these lower bounds are described in a procedural way. Because of that, it is difficult to realize the {\em logic} that is behind. In this paper we introduce an original framework for Max-SAT that stresses the parallelism with classical SAT. Then, we extend the two basic SAT solving techniques: {\em search} and {\em inference}. We show that many algorithmic {\em tricks} used in state-of-the-art Max-SAT solvers are easily expressable in {\em logic} terms with our framework in a unified manner. Besides, we introduce an original search algorithm that performs a restricted amount of {\em weighted resolution} at each visited node. We empirically compare our algorithm with a variety of solving alternatives on several benchmarks. Our experiments, which constitute to the best of our knowledge the most comprehensive Max-sat evaluation ever reported, show that our algorithm is generally orders of magnitude faster than any competitor