2,815 research outputs found
Fast iterative solvers for convection-diffusion control problems
In this manuscript, we describe effective solvers for the optimal control of stabilized convection-diffusion problems. We employ the local projection stabilization, which we show to give the same matrix system whether the discretize-then-optimize or optimize-then-discretize approach for this problem is used. We then derive two effective preconditioners for this problem, the �first to be used with MINRES and the second to be used with the Bramble-Pasciak Conjugate Gradient method. The key components of both preconditioners are an accurate mass matrix approximation, a good approximation of the Schur complement, and an appropriate multigrid process to enact this latter approximation. We present numerical results to demonstrate that these preconditioners result in convergence in a small number of iterations, which is robust with respect to the mesh size h, and the regularization parameter β, for a range of problems
A numerical comparison of solvers for large-scale, continuous-time algebraic Riccati equations and LQR problems
In this paper, we discuss numerical methods for solving large-scale
continuous-time algebraic Riccati equations. These methods have been the focus
of intensive research in recent years, and significant progress has been made
in both the theoretical understanding and efficient implementation of various
competing algorithms. There are several goals of this manuscript: first, to
gather in one place an overview of different approaches for solving large-scale
Riccati equations, and to point to the recent advances in each of them. Second,
to analyze and compare the main computational ingredients of these algorithms,
to detect their strong points and their potential bottlenecks. And finally, to
compare the effective implementations of all methods on a set of relevant
benchmark examples, giving an indication of their relative performance
Dynamically Stable 3D Quadrupedal Walking with Multi-Domain Hybrid System Models and Virtual Constraint Controllers
Hybrid systems theory has become a powerful approach for designing feedback
controllers that achieve dynamically stable bipedal locomotion, both formally
and in practice. This paper presents an analytical framework 1) to address
multi-domain hybrid models of quadruped robots with high degrees of freedom,
and 2) to systematically design nonlinear controllers that asymptotically
stabilize periodic orbits of these sophisticated models. A family of
parameterized virtual constraint controllers is proposed for continuous-time
domains of quadruped locomotion to regulate holonomic and nonholonomic outputs.
The properties of the Poincare return map for the full-order and closed-loop
hybrid system are studied to investigate the asymptotic stabilization problem
of dynamic gaits. An iterative optimization algorithm involving linear and
bilinear matrix inequalities is then employed to choose stabilizing virtual
constraint parameters. The paper numerically evaluates the analytical results
on a simulation model of an advanced 3D quadruped robot, called GR Vision 60,
with 36 state variables and 12 control inputs. An optimal amble gait of the
robot is designed utilizing the FROST toolkit. The power of the analytical
framework is finally illustrated through designing a set of stabilizing virtual
constraint controllers with 180 controller parameters.Comment: American Control Conference 201
Improving Performance of Iterative Methods by Lossy Checkponting
Iterative methods are commonly used approaches to solve large, sparse linear
systems, which are fundamental operations for many modern scientific
simulations. When the large-scale iterative methods are running with a large
number of ranks in parallel, they have to checkpoint the dynamic variables
periodically in case of unavoidable fail-stop errors, requiring fast I/O
systems and large storage space. To this end, significantly reducing the
checkpointing overhead is critical to improving the overall performance of
iterative methods. Our contribution is fourfold. (1) We propose a novel lossy
checkpointing scheme that can significantly improve the checkpointing
performance of iterative methods by leveraging lossy compressors. (2) We
formulate a lossy checkpointing performance model and derive theoretically an
upper bound for the extra number of iterations caused by the distortion of data
in lossy checkpoints, in order to guarantee the performance improvement under
the lossy checkpointing scheme. (3) We analyze the impact of lossy
checkpointing (i.e., extra number of iterations caused by lossy checkpointing
files) for multiple types of iterative methods. (4)We evaluate the lossy
checkpointing scheme with optimal checkpointing intervals on a high-performance
computing environment with 2,048 cores, using a well-known scientific
computation package PETSc and a state-of-the-art checkpoint/restart toolkit.
Experiments show that our optimized lossy checkpointing scheme can
significantly reduce the fault tolerance overhead for iterative methods by
23%~70% compared with traditional checkpointing and 20%~58% compared with
lossless-compressed checkpointing, in the presence of system failures.Comment: 14 pages, 10 figures, HPDC'1
A low-rank solution method for Riccati equations with indefinite quadratic terms
Algebraic Riccati equations with indefinite quadratic terms play an important
role in applications related to robust controller design. While there are many
established approaches to solve these in case of small-scale dense
coefficients, there is no approach available to compute solutions in the
large-scale sparse setting. In this paper, we develop an iterative method to
compute low-rank approximations of stabilizing solutions of large-scale sparse
continuous-time algebraic Riccati equations with indefinite quadratic terms. We
test the developed approach for dense examples in comparison to other
established matrix equation solvers, and investigate the applicability and
performance in large-scale sparse examples.Comment: 19 pages, 2 figures, 5 table
- …