Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 7 of 7 for “"Linear system solving"”.
-
Algorithms for fast linear system solving and rank profile computation
We give randomized algorithms for linear algebra problems concerning an n*m input matrix A over a field K. We give an algorithm that simultaneously computes the row and column rank profiles of A in 2r^3 + (r^2+n+m+|A|)^{1+o(1)} field operations in K, where r is the rank of A and |A| denotes the …
-
Fast algorithms for computing with integer matrices: normal forms and applications
… computational problems in exact integer linear algebra. Specifically, for a nonsingular integer input matrix A of dimension n, we consider problems such as linear system solving and computing integer matrix normal forms. Our goal is to design algorithms that have complexity about the same …
-
Sparse and Scalable Modular Arithmetic
… cryptography, polynomial GCD computations, and linear system solving. This thesis investigates methods to enhance the efficiency of modular arithmetic by focusing on choosing sparse and scalable moduli. A contribution of this work is the exploration of a balanced binary representation, which …
-
TOPOLOGY INDEPENDENT NETWORK SOLUTION TO LARGE LINEAR SYSTEMS
… to parallel processing on a multiprocessor system. The former has been more severely limited in bandwidth than the latter, but this is changing dramatically. It may be anticipated that only latency and shared usage will distinguish the two classes of machines. We want to solve large scale …
-
Performance Evaluation of Wells With Single and Multiple Fractures in Tight Formations
… of fluids flow in such a hydraulic fracture system is really a challenge. Numerical modeling and simulation usually requires very fine grid to reduce the truncation error and enhance the simulation accuracy. Sometimes even with fine grid, the associated computation accuracy is compromised. On …
-
Fast Order Basis and Kernel Basis Computation and Related Problems
… an efficient deterministic algorithm for solving linear systems. The algorithm for column basis also gives efficient deterministic algorithms for computing matrix GCDs, column reduced forms, and Popov normal forms for matrices of any dimension and any rank. We reduce all these problems to …
-
Parallel computational methods for solving large linear systems
… techniques, have been developed for solving large linear systems on high performance computing (HPC) infrastructures. In particular, a class of algebraic domain decomposition preconditioning schemes, using semi-aggregated subdomains, is proposed. Moreover, an interface …