scispace - formally typeset
Search or ask a question
Institution

Courant Institute of Mathematical Sciences

EducationNew York, New York, United States
About: Courant Institute of Mathematical Sciences is a education organization based out in New York, New York, United States. It is known for research contribution in the topics: Nonlinear system & Boundary value problem. The organization has 2414 authors who have published 7759 publications receiving 439773 citations. The organization is also known as: CIMS & New York University Department of Mathematics.


Papers
More filters
Book
04 Sep 2011
TL;DR: The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements, giving a concise characterization of the subdifferential in terms of a dual matrix.
Abstract: The sum of the largest eigenvalues of a symmetric matrix is a nonsmooth convex function of the matrix elements. Max characterizations for this sum are established, giving a concise characterization of the subdifferential in terms of a dual matrix. This leads to a very useful characterization of the generalized gradient of the following convex composite function: the sum of the largest eigenvalues of a smooth symmetric matrix-valued function of a set of real parameters. The dual matrix provides the information required to either verify first-order optimality conditions at a point or to generate a descent direction for the eigenvalue sum from that point, splitting a multiple eigenvalue if necessary. Connections with the classical literature on sums of eigenvalues and eigenvalue perturbation theory are discussed. Sums of the largest eigenvalues in the absolute value sense are also addressed.

193 citations

Journal ArticleDOI
TL;DR: This work indicates how to generalize this scheme for the integration of the Langevin equation to situations where holonomic constraints are added and shows that the resulting scheme remains second-order accurate.

191 citations

Journal ArticleDOI
TL;DR: This paper explains how to estimate the rate matrix of transitions between the milestones from data collected from the MD trajectories in the Voronoi cells, and shows how this rate matrix can be used to compute mean first passage times between milestones and reaction rates.
Abstract: A new milestoning procedure using Voronoi tessellations is proposed. In the new procedure, the edges of Voronoi cells are used as milestones, and the necessary kinetic information about the transitions between the milestones is calculated by running molecular dynamics (MD) simulations restricted to these cells. Like the traditional milestoning technique, the new procedure offers a reduced description of the original dynamics and permits to efficiently compute the various quantities necessary in this description. However, unlike traditional milestoning, the new procedure does not require to reinitialize trajectories from the milestones, and thereby it avoids the approximation made in traditional milestoning that the distribution for reinitialization is the equilibrium one. In this paper we concentrate on Markovian milestoning, which we show to be valid under suitable assumptions, and we explain how to estimate the rate matrix of transitions between the milestones from data collected from the MD trajectories in the Voronoi cells. The rate matrix can then be used to compute mean first passage times between milestones and reaction rates. The procedure is first illustrated on test-case examples in two dimensions and then applied to study the kinetics of protein insertion into a lipid bilayer by means of a coarse-grained model.

191 citations

Journal ArticleDOI
TL;DR: With the new formulation of these algorithms, a simplified proof is provided that the spectra of a pair of FETI‐DP and BDDC algorithms, with the same set of primal constraints, are essentially the same.
Abstract: The FETI-DP and BDDC algorithms are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal continuity constraints in these algorithms, a change of variables is used such that each primal constraint corresponds to an explicit degree of freedom. With the new formulation of these algorithms, a simplified proof is provided that the spectra of a pair of FETI-DP and BDDC algorithms, with the same set of primal constraints, are essentially the same. Numerical experiments for a two-dimensional Laplace's equation also confirm this result. Copyright © 2005 John Wiley & Sons, Ltd.

190 citations

Journal ArticleDOI
TL;DR: In this article, a variational method for computing electrical conductivity distributions from boundary measurements was proposed by Kohn and Vogelius, and the numerical performance of that technique was explored.
Abstract: A variational method for computing electrical conductivity distributions from boundary measurements was proposed by Kohn and Vogelius (1987). The authors explore the numerical performance of that technique. A version of Newton's method is used for the minimisation, and synthetic data for the boundary measurements. The variational method is found to be generally stable and robust, reproducing the locations and shapes of conducting objects well, provided that smooth boundary data are used. Early termination appears to have a desirable smoothing effect upon the reconstruction. Contrary to the suggestion of Kohn and Vogelius, the method is not enhanced by allowing the conductivity to be anisotropic.

190 citations


Authors

Showing all 2441 results

NameH-indexPapersCitations
Xiang Zhang1541733117576
Yann LeCun121369171211
Benoît Roux12049362215
Alan S. Perelson11863266767
Thomas J. Spencer11653152743
Salvatore Torquato10455240208
Joel L. Lebowitz10175439713
Bo Huang9772840135
Amir Pnueli9433143351
Rolf D. Reitz9361136618
Michael Q. Zhang9337842008
Samuel Karlin8939641432
David J. Heeger8826838154
Luis A. Caffarelli8735332440
Weinan E8432322887
Network Information
Related Institutions (5)
Princeton University
146.7K papers, 9.1M citations

87% related

Massachusetts Institute of Technology
268K papers, 18.2M citations

87% related

Carnegie Mellon University
104.3K papers, 5.9M citations

85% related

ETH Zurich
122.4K papers, 5.1M citations

85% related

University of California, Santa Barbara
80.8K papers, 4.6M citations

85% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202317
202244
2021299
2020291
2019355
2018301