skip to main content
Visitante
Meu Espaço
Minha Conta
Sair
Identificação
This feature requires javascript
Tags
Revistas Eletrônicas (eJournals)
Livros Eletrônicos (eBooks)
Bases de Dados
Bibliotecas USP
Ajuda
Ajuda
Idioma:
Inglês
Espanhol
Português
This feature required javascript
This feature requires javascript
Primo Search
Busca Geral
Busca Geral
Acervo Físico
Acervo Físico
Produção Intelectual da USP
Produção USP
Search For:
Clear Search Box
Search in:
Busca Geral
Or hit Enter to replace search target
Or select another collection:
Search in:
Busca Geral
Busca Avançada
Busca por Índices
This feature requires javascript
This feature requires javascript
Randomized Circulant and Gaussian Pre-processing
Pan, Victor Y. ; Zhao, Liang
Computer Algebra in Scientific Computing, 2015, p.361-375
[Periódico revisado por pares]
Cham: Springer International Publishing
Texto completo disponível
Citações
Citado por
Exibir Online
Detalhes
Resenhas & Tags
Mais Opções
Nº de Citações
This feature requires javascript
Enviar para
Adicionar ao Meu Espaço
Remover do Meu Espaço
E-mail (máximo 30 registros por vez)
Imprimir
Link permanente
Referência
EasyBib
EndNote
RefWorks
del.icio.us
Exportar RIS
Exportar BibTeX
This feature requires javascript
Título:
Randomized Circulant and Gaussian Pre-processing
Autor:
Pan, Victor Y.
;
Zhao, Liang
Assuntos:
Gaussian random matrices
;
linear systems
;
pivoting
;
pre-conditioning
;
pre-processing
;
Random circulant matrices
É parte de:
Computer Algebra in Scientific Computing, 2015, p.361-375
Descrição:
Circulant matrices have been extensively applied in Symbolic and Numerical Computations, but we study their new application, namely, to randomized pre-processing that supports Gaussian elimination with no pivoting, hereafter referred to as GENP. We prove that, with a probability close to 1, GENP proceeds with no divisions by 0 if the input matrix is pre-processed with a random circulant multiplier. This yields 4-fold acceleration (in the cases of both general and structured input matrices) versus pre-processing with the pair of random triangular Toeplitz multipliers, which has been the user’s favorite since 1991. In that part of our paper, we assume computations with infinite precision, but in other parts with double precision, in the presence of rounding errors. In this case, GENP fails without pre-processing unless all square leading blocks of the input matrix are well-conditioned, but empirically GENP produces accurate output consistently if a well-conditioned input matrix is pre-processed with random circulant multipliers. We also support formally the latter empirical observation if we allow standard Gaussian random input and hence the average non-singular and well-conditioned input as well, but we prove that GENP fails numerically with a probability close to 1 in the case of some specific input matrix pre-processed with such multipliers. We also prove that even for the worst case well-conditioned input, GENP runs into numerical problems only with a probability close to 0, if a nonsingular and well-conditioned input matrix is multiplied by a standard Gaussian random matrix. All our results for GENP can be readily extended to the highly important block Gaussian elimination.
Editor:
Cham: Springer International Publishing
Idioma:
Inglês
This feature requires javascript
This feature requires javascript
Voltar para lista de resultados
Anterior
Resultado
10
Avançar
This feature requires javascript
This feature requires javascript
Buscando em bases de dados remotas. Favor aguardar.
Buscando por
em
scope:(USP_VIDEOS),scope:("PRIMO"),scope:(USP_FISICO),scope:(USP_EREVISTAS),scope:(USP),scope:(USP_EBOOKS),scope:(USP_PRODUCAO),primo_central_multiple_fe
Mostrar o que foi encontrado até o momento
This feature requires javascript
This feature requires javascript