Author overlooked corrections regarding Grant number and should correctly read as.

Computing the Newton step for a generic function f : R → R takes O(N) flops. In this paper, we explore avenues for reducing this bound, when the computational structure of f is known beforehand. It is shown that the Newton step can be computed in time, linear in the size of the computational-graph, and cubic in its tree-width.

Although vascular malformations have been found in every organ, hemangioma of the colon and rectum are rare. Misdiagnosis often occurs because of lack of awareness of classic clinical features. We report a case of hemangioma involving the rectum. This 17-years-old man presented with intermittent abdominal pain for one year. CT scanning revealed a large mass occupies the lower abdomen and pelvic...

Model Predictive Control (MPC) is increasing in popularity in industry as more e cient algorithms for solving the related optimization problem are developed. The main computational bottle-neck in on-line MPC is often the computation of the search step direction, i.e. the Newton step, which is often done using generic sparsity exploiting algorithms or Riccati recursions. However, as parallel har...

In [10] we discuss general conditions to ensure global convergence of inexact restoration filter algorithms for nonlinear programming. In this paper we show how to avoid the Maratos effect by means of a second order correction. The algorithms are based on feasibility and optimality phases, which can be either independent or not. The optimality phase differs from the original one only when a ful...

In this paper, we present SILCA-Newton-Krylov, a new method for accurate, efficient and robust timedomain VLSI circuit simulation. Similar to SPICE, SILCA-Newton-Krylov uses time-difference and Newton-Raphson for solving nonlinear differential equations from circuit simulation. But different from SPICE, SILCA-Newton-Krylov explores a preconditioned flexible generalized minimal residual (FGMRES)...