In this paper, we show that the projection of a regular orthogonal array of strength t onto more than t factors consists of replicates of either a fractional factorial or a full factorial design of strength t, depending on the number of factors retained in the projection.

In this paper we show additional properties of the limit of the sequence produced by the subspace correction algorithm proposed by Fornasier and Schönlieb [24] for L2/TV -minimization problems. Inspired by the work of Vonesch and Unser [34], we adapt and specify this algorithm to the case of an orthogonal wavelet space decomposition and for deblurring problems.

A boosting framework for constructing orthogonal features targeted to a given loss function is developed. Combined with techniques from spectral methods such as PCA and PLS, an orthogonal boosting algorithm for linear hypothesis is used to efficiently construct orthogonal latent features selected to optimize the given loss function. The method is generalized to construct orthogonal nonlinear fe...

Abstract There are quantum algorithms for finding a function f satisfying set of conditions, such as solving partial differential equations, and these achieve exponential speedup compared to existing classical methods, especially when the number d variables is large. In general, however, output state which encodes in amplitudes, reading out values data from can be so time-consuming that ruined....

An orthogonal hyperprismatic grid whose all nodes are accompanied by the given function values can not be generally constructed due to the random nature of the given function data. This prevents the reduction of the single multivariate interpolation to more than one univariate or bivariate interpolations even approximately. It is generally quite difficult to determine an analytical structure fo...

It is shown that regularity of orthogonal wavelet matrices, i.e. vanishing of discrete moments of some of their rows, corresponds to maximizing the discrete moments of one of the rows. This leads to an algorithm for calculation of such wavelets by nding a vector which simultaneosly vanishes certain indeenite quadratic forms.

An orthogonal double cover (ODC) of the complete graph Kn by a graph G is a collection G of n spanning subgraphs of Kn, all isomorphic toG, such that any two members ofG share exactly one edge and every edge ofKn is contained in exactly two members of G. In the 1980s Hering posed the problem to decide the existence of an ODC for the case that G is an almost-Hamiltonian cycle, i.e. a cycle of le...

We consider the problem of generating the three-term recursion coefficients of orthogonal polynomials for a weight function v(t) = r(t)w(t), obtained by modifying a given weight function w by a rational function r. Algorithms for the construction of the orthogonal polynomials for the new weight v in terms of those for the old weight w axe presented. All the methods are based on modified moments...