A class of multi-iterate methods to solve systems of nonlinear equations
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We develop rigorous alternating direction optimization methods for a prototype constrained convex optimization template, which has broad applications in computational sciences. We build upon our earlier work on the model-based gap reduction (MGR) technique ...
The characteristic of effective properties of physical processes in heterogeneous media is a basic modeling and computational problem for many applications. As standard numerical discretization of such multiscale problems (e.g. with classical finite elemen ...
The extraction of information from measured data about the interactions taking place in a network of systems is a key topic in modern applied sciences. This topic has been traditionally addressed considering bivariate time series, providing methods that ar ...
The numerical analysis of a dynamic constrained optimization problem is presented. It consists of a global minimization problem that is coupled with a system of ordinary differential equations. The activation and the deactivation of inequality constraints ...
A novel method is presented for the systematic identification of the minimum requirements regarding mathematical pre-treatment, a priori information, or experimental design, in order to allow optimising rate constants and pure component spectra associated ...
We propose an extension of secant methods for nonlinear equations using a population of previous iterates. Contrarily to classical secant methods, where exact interpolation is used, we prefer a least squares approach to calibrate the linear model. We propo ...
We introduce a new convex formulation for stable principal component pursuit (SPCP) to decompose noisy signals into low-rank and sparse representations. For numerical solutions of our SPCP formulation, we first develop a convex variational framework and th ...
We consider elliptic PDEs (partial differential equations) in the framework of isogeometric analysis, i.e., we treat the physical domain by means of a B-spline or NURBS mapping which we assume to be regular. The numerical solution of the PDE is computed by ...
Many real-world systems are intrinsically nonlinear. This thesis proposes various algorithms for designing control laws for input-affine single-input nonlinear systems. These algorithms, which are based on the concept of quotients used in nonlinear control ...
This lecture describes the following topics: • Dynamic Models - Conservation of Mass (Concentration Measurements) - Conservation of Energy (Calorimetry) - Beer’s Law (Spectroscop ...
