Sciweavers

417 search results - page 16 / 84
» Fast Methods for Solving Linear Diophantine Equations
Sort
View
JSCIC
2008
43views more  JSCIC 2008»
13 years 8 months ago
A Dual-Petrov-Galerkin Method for the Kawahara-Type Equations
Abstract An efficient and accurate numerical scheme is proposed, analyzed and implemented for the Kawahara and modified Kawahara equations which model many physical phenomena such ...
Juan-Ming Yuan, Jie Shen, Jiahong Wu
MP
2011
12 years 11 months ago
An interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an 2-penalty functi...
Lifeng Chen, Donald Goldfarb
UIST
1997
ACM
14 years 28 days ago
Solving Linear Arithmetic Constraints for User Interface Applications
Linear equality and inequality constraints arise naturally in specifying many aspects of user interfaces, such as requiring that one window be to the left of another, requiring th...
Alan Borning, Kim Marriott, Peter J. Stuckey, Yi X...
AUTOMATICA
2004
113views more  AUTOMATICA 2004»
13 years 8 months ago
Ellipsoidal bounds for uncertain linear equations and dynamical systems
In this paper, we discuss semidefinite relaxation techniques for computing minimal size ellipsoids that bound the solution set of a system of uncertain linear equations. The propo...
Giuseppe Carlo Calafiore, Laurent El Ghaoui
DATE
2007
IEEE
114views Hardware» more  DATE 2007»
14 years 3 months ago
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a p...
Ngai Wong