Sciweavers

87 search results - page 9 / 18
» Symmetric Matrix Fields in the Finite Element Method
Sort
View
PC
2002
158views Management» more  PC 2002»
13 years 7 months ago
On parallel block algorithms for exact triangularizations
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...
Jean-Guillaume Dumas, Jean-Louis Roch
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
13 years 11 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
FOCS
2010
IEEE
13 years 5 months ago
Solving Linear Systems through Nested Dissection
Abstract--The generalized nested dissection method, developed by Lipton, Rose, and Tarjan, is a seminal method for solving a linear system Ax = b where A is a symmetric positive de...
Noga Alon, Raphael Yuster
3DPVT
2004
IEEE
116views Visualization» more  3DPVT 2004»
13 years 11 months ago
Real-Time, Accurate Depth of Field using Anisotropic Diffusion and Programmable Graphics Cards
Computer graphics cameras lack the finite Depth of Field (DOF) present in real world ones. This results in all objects being rendered sharp regardless of their depth, reducing the...
Marcelo Bertalmío, Pere Fort, Daniel S&aacu...
PARLE
1994
13 years 11 months ago
Run-Time Optimization of Sparse Matrix-Vector Multiplication on SIMD Machines
Sparse matrix-vector multiplication forms the heart of iterative linear solvers used widely in scientific computations (e.g., finite element methods). In such solvers, the matrix-v...
Louis H. Ziantz, Can C. Özturan, Boleslaw K. ...