图书馆订阅: Guest
Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集
国际不确定性的量化期刊
影响因子: 3.259 5年影响因子: 2.547 SJR: 0.417 SNIP: 0.8 CiteScore™: 1.52

ISSN 打印: 2152-5080
ISSN 在线: 2152-5099

Open Access

国际不确定性的量化期刊

DOI: 10.1615/Int.J.UncertaintyQuantification.v1.i3.40
pages 241-255

ORTHOGONAL POLYNOMIAL EXPANSIONS FOR SOLVING RANDOM EIGENVALUE PROBLEMS

Keith R. Dalbey
Department of Optimization and Uncertainty Quantification, Sandia National Laboratories, Albuquerque, New Mexico 87123, USA
George N. Karystinos
Department of Electronic and Computer Engineering, Technical University of Crete, Kounoupidiana, Chania, 73100, Greece

ABSTRACT

In the literature, space-filling Latin hypercube sample designs typically are generated by optimizing some criteria such as maximizing the minimum distance between points or minimizing discrepancy. However, such methods are time consuming and frequently produce designs that are highly regular, which can bias results. A fast way to generate irregular space-filling Latin hypercube sample designs is to randomly distribute the sample points to a pre-selected set of well-spaced bins. Such designs are said to be ”binning optimal” and are shown to be irregular. Specifically, Fourier analysis reveals regular patterns in the multi-dimensional spacing of points for the Sobol sequence but not for Binning optimal symmetric Latin hypercube sampling. For M = 2r ≤ 8 dimensions and N = 2s ≥ 2M points, where r and s are non-negative integers, simple patterns can be used to create a list of maximally spaced bins. Good Latin hypercube sample designs for non-power of two dimensions can be generated by discarding excess dimensions. Since the octants/bins containing the 2M end points of an ”orientation” (a rotated set of orthogonal axes) are maximally spaced, the process of generating the list of octants simplifies to finding a list of maximally spaced orientations. Even with this simplification, the ”patterns” for maximally spaced bins in M ≥ 16 dimensions are not so simple. In this paper, we use group theory to generate 2M / (2M) disjoint orientations, and present an algorithm to sort these into maximally spaced order. Conceptually, the procedure works for arbitrarily large numbers of dimensions. However, memory requirements currently preclude even listing the 2M / (2M) orientation leaders for M ≥ 32 dimensions. In anticipation of overcoming this obstacle, we outline a variant of the sorting algorithm with a low memory requirement for use in M ≥ 32 dimensions.


Articles with similar content:

A MULTILEVEL APPROACH FOR SEQUENTIAL INFERENCE ON PARTIALLY OBSERVED DETERMINISTIC SYSTEMS
International Journal for Uncertainty Quantification, Vol.9, 2019, issue 4
Ajay Jasra, Yi Xu, Kody J.H. Law
A MULTILEVEL MULTISCALE MIMETIC (M3) METHOD FOR AN ANISOTROPIC INFILTRATION PROBLEM
International Journal for Multiscale Computational Engineering, Vol.9, 2011, issue 2
David Moulton, Daniil Svyatskiy, Konstantin Lipnikov
Matrix Algorithms of Accelerated Computation of Fast Fourier Transform and Fast Hartley Transform
Telecommunications and Radio Engineering, Vol.56, 2001, issue 3
S. L. Zlobin, A. Ya. Stal'noy
Band Structure Analysis of 1D and 2D Photonic Crystals by Coupled Wave Method
Telecommunications and Radio Engineering, Vol.63, 2005, issue 7-12
V. M. Fitio, H. P. Laba, Ya. W. Bobitski
CHARACTERIZATION OF UNSTABLE MODES IN PARTITIONED CAVITIES
International Heat Transfer Conference 11, Vol.8, 1998, issue
Emilie Gadoin, Patrick Le Quere