Buscar
Mostrando ítems 1-10 de 976
Fast-forward/fast-backward substitutions on vector computers
(Institute of Electrical and Electronics Engineers (IEEE), 1999-11-01)
This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...
Fast-forward/fast-backward substitutions on vector computers
(Institute of Electrical and Electronics Engineers (IEEE), 1999-11-01)
This paper deals with approaches for sparse matrix substitutions using vector processing. Many publications have used the W-matrix method to solve the forward/backward substitutions on vector computer. Recently a different ...
Sparse bounds for Bochner–Riesz multiplers
(2019)
The Bochner–Riesz multipliers are shown to satisfy a range of sparse bounds. The range of sparse bounds increases to the optimal range, as δ increases to the critical value, even assuming only partial information on the ...
Sparse bounds for the discrete spherical maximal functions
(2020)
We prove sparse bounds for the spherical maximal operator of Magyar, Stein and Wainger. The bounds are conjecturally sharp, and contain an endpoint estimate. The new method of proof is inspired by ones by Bourgain and ...
COMPARING ALGORITHMS FOR SOLVING SPARSE NONLINEAR-SYSTEMS OF EQUATIONS
(Siam PublicationsPhiladelphia, 1992)
BANDWIDTH REDUCTION ON SPARSE MATRICES BY INTRODUCING NEW VARIABLES
(Universidad de Tarapacá., 2010)
Inpainting method based on variational calculus and sparse matrices
(Proceedings of SPIE - The International Society for Optical Engineering, 2022)
Fast-forward/fast-backward substitutions on vector computers
(Institute of Electrical and Electronics Engineers (IEEE), 2014)
An alternative to classical latent class models selection methods for sparse binary data: an illustration with simulated data
(Centro de Investigaciones en Matemática Pura y Aplicada (CIMPA) y Escuela de Matemática, San José, Costa Rica., 2016)