Sciweavers

381 search results - page 6 / 77
» Fraction-Free RNS Algorithms for Solving Linear Systems
Sort
View
LSSC
2005
Springer
14 years 1 months ago
Improved Solution Enclosures for Over- and Underdetermined Interval Linear Systems
Abstract. In this paper we discuss an inclusion method for solving rectangular (over- and under-determined) dense linear systems where the input data are uncertain and vary within ...
Evgenija D. Popova
RTA
1997
Springer
13 years 12 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
SC
2009
ACM
14 years 2 months ago
Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...
Fengguang Song, Asim YarKhan, Jack Dongarra
IMA
2009
Springer
111views Cryptology» more  IMA 2009»
14 years 2 months ago
Geometric Ideas for Cryptographic Equation Solving in Even Characteristic
Abstract. The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis al...
Sean Murphy, Maura B. Paterson
UIST
1997
ACM
13 years 12 months 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...