UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

A Model for the Frequency Distribution of Multi-Scale Phenomena

Information (Basel), 2020-12, Vol.11 (12), p.580

2020

Volltextzugriff (PDF)

Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix

Algorithms, 2019-10, Vol.12 (10), p.216

2019

Volltextzugriff (PDF)

An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions

Algorithms, 2019-05, Vol.12 (5), p.109

2019

Volltextzugriff (PDF)

A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems

SIAM journal on matrix analysis and applications, 2012-01, Vol.33 (4), p.1039-1056

2012

Volltextzugriff (PDF)

Regularized Compression of A Noisy Blurred Image

International Journal on Computational Science & Applications, 2016-12, Vol.6 (5/6), p.1-13

2016

Volltextzugriff (PDF)

An inner-outer regularizing method for ill-posed problems

Inverse problems and imaging (Springfield, Mo.), 2014, Vol.8 (2), p.409-420

2014

Volltextzugriff (PDF)

Algorithm 691: Improving QUADPACK automatic integration routines

ACM transactions on mathematical software, 1991-06, Vol.17 (2), p.218-232

1991

Volltextzugriff (PDF)

Efficient and stable solution of M-matrix linear systems of (block) Hessenberg form

SIAM journal on matrix analysis and applications, 2003, Vol.24 (3), p.852-876

2003

Volltextzugriff (PDF)

Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form

Numerical algorithms, 2004-06, Vol.36 (2), p.157-168

2004

Volltextzugriff (PDF)

A Stochastic Model for the Link Analysis of the Web

Internet mathematics, 2006-01, Vol.3 (4), p.509-531

2006

Volltextzugriff (PDF)

O( n2.7799) complexity for n × n approximate matrix multiplication

Information processing letters, 1979-06, Vol.8 (5), p.234-235

1979

Volltextzugriff (PDF)

Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos

Theoretical computer science, 1997-03, Vol.174 (1), p.157-170

1997

Volltextzugriff (PDF)

Solution of infinite linear systems by automatic adaptive iterations

Linear algebra and its applications, 2000-10, Vol.318 (1), p.209-225

2000

Volltextzugriff (PDF)

Railway computation for infinite linear systems

International journal of parallel programming, 2002-12, Vol.30 (6), p.419-439

2002

Volltextzugriff (PDF)

Fast solution of linear systems with polynomial coefficients over the ring of integers

Journal of algorithms, 1992-12, Vol.13 (4), p.564-576

Lotti, Grazia

1992

Volltextzugriff (PDF)

Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas

BIT, 1994-12, Vol.34 (4), p.546-557

1994

Volltextzugriff (PDF)

Area-time tradeoff for rectangular matrix multiplication in VLSI models

Information processing letters, 1984-08, Vol.19 (2), p.95-98

Lotti, Grazia

1984

Volltextzugriff (PDF)

Local error estimates and regularity tests for the implementation of double adaptive quadrature

ACM transactions on mathematical software, 1997-03, Vol.23 (1), p.16-31

1997

Volltextzugriff (PDF)

Parallel algorithms for matrix polynomial division

Computers & mathematics with applications (1987), 1991, Vol.22 (7), p.37-42

1991

Volltextzugriff (PDF)

Bounds on the error of fejer and clenshaw-curtis type quadrature for analytic functions

Applied mathematics letters, 1993-11, Vol.6 (6), p.3-8

1993

Volltextzugriff (PDF)

The application of VLSI poisson solvers to the biharmonic problem

Parallel computing, 1992, Vol.18 (1), p.11-19

1992

Volltextzugriff (PDF)

Interpolatory integration formulas for optimal composition

ACM transactions on mathematical software, 1991-06, Vol.17 (2), p.207-217

1991

Volltextzugriff (PDF)

Asymptotic Behavior of Automatic Quadrature

Journal of Complexity, 1994, Vol.10 (3), p.296-340

1994

Volltextzugriff (PDF)

On the asymptotic complexity of rectangular matrix multiplication

Theoretical computer science, 1983, Vol.23 (2), p.171-185

1983

Volltextzugriff (PDF)

A VLSI fast solver for tridiagonal linear systems

Information processing letters, 1986-10, Vol.23 (3), p.111-114

1986

Volltextzugriff (PDF)

1 – 25 von 101

Menü

Weitere Dienste

Einstellungen

A Model for the Frequency Distribution of Multi-Scale Phenomena

Adaptive Clustering via Symmetric Nonnegative Matrix Factorization of the Similarity Matrix

An Adaptive Procedure for the Global Minimization of a Class of Polynomial Functions

A Divide and Conquer Algorithm for the Superfast Solution of Toeplitz-like Systems

Regularized Compression of A Noisy Blurred Image

An inner-outer regularizing method for ill-posed problems

Algorithm 691: Improving QUADPACK automatic integration routines

Efficient and stable solution of M-matrix linear systems of (block) Hessenberg form

Rounding Error Analysis in Solving M-Matrix Linear Systems of Block Hessenberg Form

A Stochastic Model for the Link Analysis of the Web

O( n2.7799) complexity for n × n approximate matrix multiplication

Additive one-dimensional cellular automata are chaotic according to Devaney's definition of chaos

Solution of infinite linear systems by automatic adaptive iterations

Railway computation for infinite linear systems

Fast solution of linear systems with polynomial coefficients over the ring of integers

Theoretical and practical efficiency measures for symmetric interpolatory quadrature formulas

Area-time tradeoff for rectangular matrix multiplication in VLSI models

Local error estimates and regularity tests for the implementation of double adaptive quadrature

Parallel algorithms for matrix polynomial division

Bounds on the error of fejer and clenshaw-curtis type quadrature for analytic functions

The application of VLSI poisson solvers to the biharmonic problem

Interpolatory integration formulas for optimal composition

Asymptotic Behavior of Automatic Quadrature

On the asymptotic complexity of rectangular matrix multiplication

A VLSI fast solver for tridiagonal linear systems

Suchergebnisse filtern