Alexandre J. Chorin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Alexandre J. Chorin has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Ole H. Hald
University of Californian at Berkeley
8 shared publications - Anton P. Kast
Lawrence Berkeley National Laboratory, Department of Mathematics, One Cyclotron Road, MS 50A‐215, Berkeley, CA 94720
2 shared publications - Fei Lu
Department of Mathematics Berkeley and Lawrence University of California Berkeley National Labo- ratory
2 shared publications - Kevin Lin
University of Arizona
2 shared publications - Matthias Morzfeld
Department of Electrical Engineering and Computer Sciences University of California 94720 Berkeley CA USA
2 shared publications Ole H. Hald
Department of Mathematics, UC, Berkeley, USA
2 shared publications
Latest Publications
- 23 March 2022
- Published by The Royal Society in Biographical Memoirs of Fellows of the Royal Society
- Vol. 72, 33-53
Grigory Isaakovich Barenblatt. 10 July 1927 — 22 June 2018
Grigory Barenblatt devoted his scientific life to the analysis of difficult and important problems in mechanics: turbulence, including turbulence in the oceans and the atmosphere and in polymeric fluids, fracture, fatigue and damage accumulation in solids, flow in porous media, and combustion. He made use of sophisticated and innovative mathematical tools that he himself developed with his collaborators: in particular, similarity, scaling methods and intermediate asymptotics. During the years up to the dissolution of the USSR, he held senior positions in the Institute of Petroleum, the Institute for Problems in Mechanics and the Institute of Oceanology, all institutes of the USSR Academy of Sciences, and the Department of Plasticity at the Institute of Mechanics, Lomonosov Moscow State University. In 1992 he was appointed the first G. I. Taylor Professor of Fluid Mechanics at the Department of Applied Mathematics and Theoretical Physics, University of Cambridge, and then in 1996, he was appointed Professor in Residence, Department of Mathematics, University of California at Berkeley. His work has garnered many prestigious awards and world-wide recognition.
- 23 March 2022
- Published by The Royal Society in Biographical Memoirs of Fellows of the Royal Society
- Vol. 72, 33-53
Grigory Isaakovich Barenblatt. 10 July 1927 — 22 June 2018
Grigory Barenblatt devoted his scientific life to the analysis of difficult and important problems in mechanics: turbulence, including turbulence in the oceans and the atmosphere and in polymeric fluids, fracture, fatigue and damage accumulation in solids, flow in porous media, and combustion. He made use of sophisticated and innovative mathematical tools that he himself developed with his collaborators: in particular, similarity, scaling methods and intermediate asymptotics. During the years up to the dissolution of the USSR, he held senior positions in the Institute of Petroleum, the Institute for Problems in Mechanics and the Institute of Oceanology, all institutes of the USSR Academy of Sciences, and the Department of Plasticity at the Institute of Mechanics, Lomonosov Moscow State University. In 1992 he was appointed the first G. I. Taylor Professor of Fluid Mechanics at the Department of Applied Mathematics and Theoretical Physics, University of Cambridge, and then in 1996, he was appointed Professor in Residence, Department of Mathematics, University of California at Berkeley. His work has garnered many prestigious awards and world-wide recognition.
- Open Access
Comparison of continuous and discrete-time data-based modeling for hypoelliptic systems
We compare two approaches to the predictive modeling of dynamical systems from partial observations at discrete times. The first is continuous in time, where one uses data to infer a model in the form of stochastic differential equations, which are then discretized for numerical solution. The second is discrete in time, where one directly infers a discrete-time model in the form of a nonlinear autoregression moving average model. The comparison is performed in a special case where the observations are known to have been obtained from a hypoelliptic stochastic differential equation. We show that the discrete-time approach has better predictive skills, especially when the data are relatively sparse in time. We discuss open questions as well as the broader significance of the results.
Open AccessComparison of continuous and discrete-time data-based modeling for hypoelliptic systems
We compare two approaches to the predictive modeling of dynamical systems from partial observations at discrete times. The first is continuous in time, where one uses data to infer a model in the form of stochastic differential equations, which are then discretized for numerical solution. The second is discrete in time, where one directly infers a discrete-time model in the form of a nonlinear autoregression moving average model. The comparison is performed in a special case where the observations are known to have been obtained from a hypoelliptic stochastic differential equation. We show that the discrete-time approach has better predictive skills, especially when the data are relatively sparse in time. We discuss open questions as well as the broader significance of the results.
- Open Access
Data-based stochastic model reduction for the Kuramoto--Sivashinsky equation
The problem of constructing data-based, predictive, reduced models for the Kuramoto-Sivashinsky equation is considered, under circumstances where one has observation data only for a small subset of the dynamical variables. Accurate prediction is achieved by developing a discrete-time stochastic reduced system, based on a NARMAX (Nonlinear Autoregressive Moving Average with eXogenous input) representation. The practical issue, with the NARMAX representation as with any other, is to identify an efficient structure, i.e., one with a small number of terms and coefficients. This is accomplished here by estimating coefficients for an approximate inertial form. The broader significance of the results is discussed.
Open AccessData-based stochastic model reduction for the Kuramoto--Sivashinsky equation
The problem of constructing data-based, predictive, reduced models for the Kuramoto-Sivashinsky equation is considered, under circumstances where one has observation data only for a small subset of the dynamical variables. Accurate prediction is achieved by developing a discrete-time stochastic reduced system, based on a NARMAX (Nonlinear Autoregressive Moving Average with eXogenous input) representation. The practical issue, with the NARMAX representation as with any other, is to identify an efficient structure, i.e., one with a small number of terms and coefficients. This is accomplished here by estimating coefficients for an approximate inertial form. The broader significance of the results is discussed.
- 27 July 2015
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 112 (32) , 9804-9809
Discrete approach to stochastic parametrization and dimension reduction in nonlinear dynamics
Significance: Many problems in science are too large and/or too complex to be fully analyzed by standard methods of computation. We present an approach where such problems are treated statistically, and the statistical analysis and the equations actually solved are discrete rather than continuous. We connect our approach to well-known results in statistical physics, and demonstrate its effectiveness in a widely used test problem.
- 27 July 2015
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 112 (32) , 9804-9809
Discrete approach to stochastic parametrization and dimension reduction in nonlinear dynamics
Significance: Many problems in science are too large and/or too complex to be fully analyzed by standard methods of computation. We present an approach where such problems are treated statistically, and the statistical analysis and the equations actually solved are discrete rather than continuous. We connect our approach to well-known results in statistical physics, and demonstrate its effectiveness in a widely used test problem.
- Open Access
- 1 January 2015
- Published by Uspekhi Fizicheskikh Nauk (UFN) Journal in Uspekhi Fizicheskih Nauk
- Vol. 185 (2) , 217-220
On the problem of turbulent flows in pipes at very large Reynolds numbers (reply to comment by I I Vigdorovich [Phys. Usp. 58 (2015); Usp. Fiz. Nauk 185 213 (2015)] on "Turbulent flows at very large Reynolds numbers: new lessons learned" [Phys. Usp. 57 250 (2014); Usp. Fiz. Nauk184 265 (2014)])
? ???????? ???????????? ??????? ? ?????? ??? ????? ??????? ?????? ?????????? (????? ?? ??????????? ?.?. ??????????? [??? 185 213 (2015)] ? ?????? "???????????? ??????? ??? ????? ??????? ?????? ??????????: ????? ????? ????????????" [??? 184 265 2014]), ?????????? ?.?., ????? ?.??., ??????????? ?.?.
- 1 January 2015
- Published by Uspekhi Fizicheskikh Nauk (UFN) Journal in Uspekhi Fizicheskih Nauk
- Vol. 185 (2) , 217-220
Open AccessOn the problem of turbulent flows in pipes at very large Reynolds numbers (reply to comment by I I Vigdorovich [Phys. Usp. 58 (2015); Usp. Fiz. Nauk 185 213 (2015)] on "Turbulent flows at very large Reynolds numbers: new lessons learned" [Phys. Usp. 57 250 (2014); Usp. Fiz. Nauk184 265 (2014)])
? ???????? ???????????? ??????? ? ?????? ??? ????? ??????? ?????? ?????????? (????? ?? ??????????? ?.?. ??????????? [??? 185 213 (2015)] ? ?????? "???????????? ??????? ??? ????? ??????? ?????? ??????????: ????? ????? ????????????" [??? 184 265 2014]), ?????????? ?.?., ????? ?.??., ??????????? ?.?.
- Open Access
Path integral formulation of stochastic optimal control with generalized costs
Path integral control solves a class of stochastic optimal control problems with a Monte Carlo (MC) method for an associated Hamilton-Jacobi-Bellman (HJB) equation. The MC approach avoids the need for a global grid of the domain of the HJB equation and, therefore, path integral control is in principle applicable to control problems of moderate to large dimension. The class of problems path integral control can solve, however, is defined by requirements on the cost function, the noise covariance matrix and the control input matrix. We relax the requirements on the cost function by introducing a new state that represents an augmented running cost. In our new formulation the cost function can contain stochastic integral terms and linear control costs, which are important in applications in engineering, economics and finance. We find an efficient numerical implementation of our grid-free MC approach and demonstrate its performance and usefulness in examples from hierarchical electric load management. The dimension of one of our examples is large enough to make classical grid-based HJB solvers impractical.
Open AccessPath integral formulation of stochastic optimal control with generalized costs
Path integral control solves a class of stochastic optimal control problems with a Monte Carlo (MC) method for an associated Hamilton-Jacobi-Bellman (HJB) equation. The MC approach avoids the need for a global grid of the domain of the HJB equation and, therefore, path integral control is in principle applicable to control problems of moderate to large dimension. The class of problems path integral control can solve, however, is defined by requirements on the cost function, the noise covariance matrix and the control input matrix. We relax the requirements on the cost function by introducing a new state that represents an augmented running cost. In our new formulation the cost function can contain stochastic integral terms and linear control costs, which are important in applications in engineering, economics and finance. We find an efficient numerical implementation of our grid-free MC approach and demonstrate its performance and usefulness in examples from hierarchical electric load management. The dimension of one of our examples is large enough to make classical grid-based HJB solvers impractical.
- 1 January 2014
- Published by Springer Nature
- p. 171-182
Implicit Sampling, with Application to Data Assimilation
- 1 January 2014
- Published by Springer Nature
- p. 171-182
Implicit Sampling, with Application to Data Assimilation
- 8 October 2013
- Published by SAGE Publications in Mathematics and Mechanics of Solids
- Vol. 19 (1) , 28-38
Estimating the uncertainty in underresolved nonlinear dynamics
The Mori–Zwanzig formalism of statistical mechanics is used to estimate the uncertainty caused by underresolution in the solution of a nonlinear dynamical system. A general approach is outlined and applied to a simple example. The noise term that describes the uncertainty turns out to be neither Markovian nor Gaussian. It is argued that this is the general situation.
- 8 October 2013
- Published by SAGE Publications in Mathematics and Mechanics of Solids
- Vol. 19 (1) , 28-38
Estimating the uncertainty in underresolved nonlinear dynamics
The Mori–Zwanzig formalism of statistical mechanics is used to estimate the uncertainty caused by underresolution in the solution of a nonlinear dynamical system. A general approach is outlined and applied to a simple example. The noise term that describes the uncertainty turns out to be neither Markovian nor Gaussian. It is argued that this is the general situation.
- 29 January 2013
- Published by Springer Nature in Chinese Annals of Mathematics, Series B
- Vol. 34 (1) , 89-98
Implicit Sampling, with Application to Data Assimilation
- 29 January 2013
- Published by Springer Nature in Chinese Annals of Mathematics, Series B
- Vol. 34 (1) , 89-98
Implicit Sampling, with Application to Data Assimilation
- Open Access
- 11 January 2012
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 46 (3) , 535-543
An iterative implementation of the implicit nonlinear filter
Implicit sampling is a sampling scheme for particle filters, designed to move particles one-by-one so that they remain in high-probability domains. We present a new derivation of implicit sampling, as well as a new iteration method for solving the resulting algebraic equations.
- 11 January 2012
- Published by EDP Sciences in ESAIM: Mathematical Modelling and Numerical Analysis
- Vol. 46 (3) , 535-543
Open AccessAn iterative implementation of the implicit nonlinear filter
Implicit sampling is a sampling scheme for particle filters, designed to move particles one-by-one so that they remain in high-probability domains. We present a new derivation of implicit sampling, as well as a new iteration method for solving the resulting algebraic equations.