Sciweavers

573 search results - page 60 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
MANSCI
2007
139views more  MANSCI 2007»
13 years 9 months ago
A Market-Based Optimization Algorithm for Distributed Systems
In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matc...
Zhiling Guo, Gary J. Koehler, Andrew B. Whinston
ITCC
2000
IEEE
14 years 1 months ago
A Unified Derivation of Operational Matrices for Integration in Systems Analysis
Using the operational matrix of an orthogonal function to perform integration for solving, identifying and optimizing a linear dynamic system has several advantages: (1) the metho...
Jiunn-lin Wu, Chin-hsing Chen, Chih-fan Chen
SIAMSC
2008
113views more  SIAMSC 2008»
13 years 9 months ago
An Efficient and Robust Method for Simulating Two-Phase Gel Dynamics
We develop a computational method for simulating models of gel dynamics where the gel is described by two phases, a networked polymer and a fluid solvent. The models consist of tra...
Grady B. Wright, Robert D. Guy, Aaron L. Fogelson
PE
2010
Springer
102views Optimization» more  PE 2010»
13 years 7 months ago
Extracting state-based performance metrics using asynchronous iterative techniques
Solution of large sparse linear fixed-point problems lies at the heart of many important performance analysis calculations. These calculations include steady-state, transient and...
Douglas V. de Jager, Jeremy T. Bradley
ICRA
2008
IEEE
150views Robotics» more  ICRA 2008»
14 years 3 months ago
A Bayesian approach to empirical local linearization for robotics
— Local linearizations are ubiquitous in the control of robotic systems. Analytical methods, if available, can be used to obtain the linearization, but in complex robotics system...
Jo-Anne Ting, Aaron D'Souza, Sethu Vijayakumar, St...