The finite element discretization of the incompressible steady-state Navier-Stokes equations yields a non-linear problem, due to the convective terms in the momentum equations. Several methods may be used to solve this non-linear problem. In this work we study Inexact Newton-type methods, associated with the SUPG/PSPG stabilized finite element formulation. The resulting systems of equations are...

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your perso...

A recent proof-of-principle study proposes an energy-and charge-conserving, nonlinearly implicit elec-trostatic particle-in-cell (PIC) algorithm in one dimension [Chen et al, The algorithm in the reference employs an unpreconditioned Jacobian-free Newton-Krylov method, which ensures nonlinear convergence at every timestep (resolving the dynamical timescale of interest). Kinetic enslavement, whi...

This paper presents an in silico optimization method of metabolic pathway production. The metabolic pathway can be represented by a mathematical model known as the generalized mass action model, which leads to a complex nonlinear equations system. The optimization process becomes difficult when steady state and the constraints of the components in the metabolic pathway are involved. To deal wit...

A direct generalized Newton method is proposed for solving the NP-hard absolute value equation (AVE) Ax−|x| = b when the singular values of A exceed 1. A simple MATLAB implementation of the method solved 100 randomly generated 1000-dimensional AVEs to an accuracy of 10−6 in less than 10 seconds each. Similarly, AVEs corresponding to 100 randomly generated linear complementarity problems with 10...

This paper develops an algorithm for solving mixed complementarity problems which is based upon probability one homotopy methods. After the complementarity problem is reformulated as a system of nonsmooth equations, a homotopy method is used to solve a sequence of smooth approximations to this system of equations. The global convergence properties of this approach are considerably stronger than...

In this paper we study the problem of model selection for a linear programming-based support vector machine for regression. We propose generalized method that is based on a quasi-Newton method that uses a globalization strategy and an inexact computation of first order information. We explore the case of two-class, multi-class, and regression problems. Simulation results among standard datasets...

We propose a method for solving nonlinear second-order cone programs (SOCPs), based on a continuously differentiable exact penalty function. The construction of the penalty function is given by incorporating a multipliers estimate in the augmented Lagrangian for SOCPs. Under the nondegeneracy assumption and the strong second-order sufficient condition, we show that a generalized Newton method h...