Search

To address the problem of low accuracy and efficiency in trajectory planning algorithms for interceptors facing multiple constraints during the midcourse guidance phase, an improved trajectory convex programming method based on the lateral distance domain is proposed. This algorithm can achieve fast trajectory planning, reduce the approximation error of the planned trajectory, and improve the accuracy of trajectory guidance. First, the concept of lateral distance domain is proposed, and the motion model of the midcourse guidance segment in the interceptor is converted from the time domain to the lateral distance domain. Second, the motion model and multiple constraints are convexly and discretely transformed, and the discrete trajectory convex model is established in the lateral distance domain. Third, the deep reinforcement learning algorithm is used to learn and train the initial solution of trajectory convex programming, and a high-quality initial solution trajectory is obtained. Finally, a dynamic adjustment method based on the distribution of approximate solution errors is designed to achieve efficient dynamic adjustment of grid points in iterative solving. The simulation experiments show that the improved trajectory convex programming algorithm proposed in this paper not only improves the accuracy and efficiency of the algorithm but also has good optimization performance. [ABSTRACT FROM AUTHOR]

Uncompensated motion errors can seriously affect the imaging quality of synthetic aperture sonars (SASs). In the existing line-by-line motion compensation (MOCO) algorithms for wide-beam multiple-receiver SAS systems, the approximate form of the range history error usually introduces a significant approximation error, and the residual two-dimensional (2D) range cell migration (RCM) caused by aperture-dependent motion errors is not corrected, resulting in the severe defocus of the image. In this paper, in the presence of translational and rotational errors in a multiple-receiver SAS system, the exact range history error concerning the five-degree-of-freedom (DOF) motion errors of the sway, heave, yaw, pitch, and roll under the non-stop-hop-stop case is derived. Based on this, a two-stage subaperture MOCO algorithm for wide-beam multiple-receiver SAS systems is proposed. We decompose the range history error into the beam-center term (BCT) and the residual spatial-variant term (RSVT) to compensate successively. In the first stage, the time delay and phase error caused by the BCT are compensated receiver-by-receiver through interpolation and phase multiplication in the azimuth-time domain. In the second stage, the data of a single pulse are regarded as a subaperture, and the RSVT is compensated in the subaperture range-Doppler (RD) domain. We divide the range into several blocks to correct RCM caused by the RSVT in the subaperture RD domain, and the phase error caused by the RSVT is compensated by phase multiplication. After compensation, the wide-beam RD algorithm is used for imaging. Simulated and real-data experiments verify the superiority and robustness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

An efficient numerical algorithm is developed for solving nonlinear functional Volterra integral equations. The core idea is to define an appropriate operator, then combine the Krasnoselskij iterative scheme with collocation at discrete points and the Newton–Cotes quadrature rule. This results in an explicit scheme that does not require solving a nonlinear or linear algebraic system. For the convergence analysis, the discretization error is estimated and proved to converge via a recurrence relation. The discretization error is combined with the Krasnoselskij iteration error to estimate the total approximation error, hence establishing the convergence of the method. Then, numerical experiments are provided, first, to demonstrate the second order convergence of the proposed method, and secondly, to show the better performance of the scheme over the existing nonlinear-based approach. [ABSTRACT FROM AUTHOR]

Ground-based multiple-input multiple-output synthetic aperture radar (MIMO-SAR) is a new type of deformation monitoring sensor that has the advantages of no mechanical motion and fast echo acquisition. Ground-based MIMO-SAR can significantly improve the data rate of deformation monitoring. In this paper, a fast imaging algorithm tailored for ground-based MIMO-SAR data is proposed, which can be applied in both far-field and near-field scenarios. First, the phase center approximation error of the non-collinear array in the near field is analyzed. Then, a fast imaging algorithm based on geometric transformation for the coherent synthesis of subimages is put forward. The algorithm uses the geometric transformation to convert the subaperture imaging results into the full aperture coordinate system, which avoids the point-by-point interpolation calculation and further reduces the computational cost of the subimage coherent synthesis algorithm. Simulations and experiments show that the algorithm can achieve high-precision focusing imaging, and its operation efficiency is significantly improved compared with the algorithm based on interpolation. [ABSTRACT FROM AUTHOR]

We present REGA, a new adaptive-sampling-based algorithm for the control of finite-horizon Markov decision processes (MDPs) with very large state spaces and small action spaces. We apply a variant of the ϵ -greedy multiarmed bandit algorithm to each stage of the MDP in a recursive manner, thus computing an estimation of the "reward-to-go" value at each stage of the MDP. We provide a finite-time analysis of REGA. In particular, we provide a bound on the probability that the approximation error exceeds a given threshold, where the bound is given in terms of the number of samples collected at each stage of the MDP. We empirically compare REGA against another sampling-based algorithm called RASA by running simulations against the SysAdmin benchmark problem with 2 10 states. The results show that REGA and RASA achieved similar performance. Moreover, REGA and RASA empirically outperformed an implementation of the algorithm that uses the "original" ϵ -greedy algorithm that commonly appears in the literature. [ABSTRACT FROM AUTHOR]

We present an inexact proximal point algorithm using quasi distances to solve a minimization problem in the Euclidean space. This algorithm is motivated by the proximal methods introduced by Attouch et al., section 4, (Math Program Ser A, 137: 91–129, 2013) and Solodov and Svaiter (Set Valued Anal 7:323–345, 1999). In contrast, in this paper we consider quasi distances, arbitrary (non necessary smooth) objective functions, scalar errors in each objective regularized approximation and vectorial errors on the residual of the regularized critical point, that is, we have an error on the optimality condition of the proximal subproblem at the new point. We obtain, under a coercivity assumption of the objective function, that all accumulation points of the sequence generated by the algorithm are critical points (minimizer points in the convex case) of the minimization problem. As an application we consider a human location problem: How to travel around the world and prepare the trip of a lifetime. [ABSTRACT FROM AUTHOR]

Directed networks are broadly used to represent asymmetric relationships among units. Co-clustering aims to cluster the senders and receivers of directed networks simultaneously. In particular, the well-known spectral clustering algorithm could be modified as the spectral co-clustering to co-cluster directed networks. However, large-scale networks pose great computational challenges to it. In this paper, we leverage sketching techniques and derive two randomized spectral co-clustering algorithms, one random-projection-based and the other random-sampling-based, to accelerate the co-clustering of large-scale directed networks. We theoretically analyze the resulting algorithms under two generative models - the stochastic co-block model and the degree-corrected stochastic co-block model, and establish their approximation error rates and misclustering error rates, indicating better bounds than the state-of-the-art results of co-clustering literature. Numerically, we design and conduct simulations to support our theoretical results and test the efficiency of the algorithms on real networks with up to millions of nodes. A publicly available R package RandClust is developed for better usability and reproducibility of the proposed methods. [ABSTRACT FROM AUTHOR]

This article investigates the finite-time distributed approximate optimization problem of higher order multiagent systems, where the local cost functions are considered to be quadratic functions. This problem is solved via penalty-function-based method. First, by the penalty-function method, a global approximate cost function is constructed. Second, nonlinear distributed optimization algorithms are proposed for higher order multiagent systems by the tool of adding a power integrator technique. In the optimization algorithms design, the gradients of the approximate cost function are utilized. Under the proposed optimization algorithms, the agents approach the approximate optimal solution in finite time. Although there exist errors (they may be called approximation errors) between the approximate minimizers and the global accurate minimizer, the approximation errors can be regulated by penalty parameter and the relationship between the bound of the approximation errors and the penalty parameter is given explicitly. Furthermore, the proposed distributed approximate optimization algorithms are applied to the optimal rendezvous problem of wheeled multimobile robots, making the mobile robots achieve approximate optimization rendezvous in finite time. The effectiveness of the proposed distributed optimization algorithms and their applications to optimal rendezvous problem are validated by simulations. [ABSTRACT FROM AUTHOR]

We present new algorithms for $k$ k -means clustering on a data stream with a focus on providing fast responses to clustering queries. Compared to the state-of-the-art, our algorithms provide substantial improvements in the query time for cluster-center queries while retaining the desirable properties of provably small approximation error and low space usage. Our proposed clustering algorithms systematically reuse the “coresets” (summaries of data) computed for recent queries in answering the current clustering query, a novel technique which we refer to as coreset caching. We also present an algorithm called OnlineCC that integrates the coreset caching idea with a simple sequential streaming $k$ k -means algorithm. In practice, OnlineCC algorithm can provide constant query time. We present both theoretical analysis and detailed experiments demonstrating the correctness, accuracy, and efficiency of all our proposed clustering algorithms. [ABSTRACT FROM AUTHOR]

This paper focuses on the design of a distributed algorithm for generalized eigenvalue problems (GEPs) in one-shot communication. Since existing distributed methods for eigenvalue decomposition cannot be applied to GEP, a general one-shot distributed GEP framework is proposed. The theoretical analysis of the approximation error reveals its relation to the divergence of the data covariance, the eigenvalues of the empirical data covariance, and the number of local servers. If the symmetric data covariance has repeated eigenvalues in GEP, e.g., in canonical component analysis, we further modify the method for better convergence and prove the necessity experimentally. Numerical experiments validate the effectiveness of the proposed algorithms both on synthetic and real-world datasets. [ABSTRACT FROM AUTHOR]

The $K$ K -means algorithm is one of the most popular clustering methods. However, it is a well-known fact that its performance, in terms of quality of the obtained solution and computational load, highly depends upon its initialization phase. For this reason, different initialization techniques have been developed throughout the years to enable its fast convergence to competitive solutions. In this sense, it is common practice to re-start the $K$ K -means algorithm several times via one of these techniques and keep the solution with the lowest error. Unfortunately, such a choice is still likely to be a poor approximation of the optimal set of centroids. In this article, we introduce a cheap Split-Merge step that can be used to re-start the $K$ K -means algorithm after reaching a fixed point. Under some settings, one can show that this approach reduces the error of the given fixed point without requiring any further iteration of the $K$ K -means algorithm. Moreover, experimental results show that this strategy is able to generate approximations with an associated error that is hard to reach for different multi-start methods, such as multi-start Forgy $K$ K -means, $K$ K -means++ and Hartigan $K$ K -means, while also computing a lower amount of distances than the previous algorithms. [ABSTRACT FROM AUTHOR]

The Binary Iterative Hard Thresholding (BIHT) algorithm is a popular reconstruction method for one-bit compressed sensing due to its simplicity and fast empirical convergence. Despite considerable research on this algorithm, a theoretical understanding of the corresponding approximation error and convergence rate still remains an open problem. This paper shows that the normalized version of BIHT (NBIHT) achieves an approximation error rate optimal up to logarithmic factors. More precisely, using $m$ one-bit measurements of an $s$ -sparse vector $x$ , we prove that the approximation error of NBIHT is of order $O \left ({\frac{1 }{ m }}\right)$ up to logarithmic factors, which matches the information-theoretic lower bound $\Omega \left ({\frac{1 }{ m }}\right)$ proved by Jacques, Laska, Boufounos, and Baraniuk in 2013. To our knowledge, this is the first theoretical analysis of a BIHT-type algorithm that explains the optimal rate of error decay empirically observed in the literature. This also makes NBIHT the first provable computationally-efficient one-bit compressed sensing algorithm that breaks the inverse square-root error decay rate $O \left ({\frac{1 }{ m^{1/2} }}\right)\vphantom {{\left ({\frac{1 }{ m^{1/2} }}\right)}^{'}}$. [ABSTRACT FROM AUTHOR]

The quantum Monte Carlo algorithm can provide significant speedup compared to its classical counterpart. So far, most reported works have utilized Grover's state preparation algorithm. However, this algorithm relies on costly controlled Y rotations to apply the correct amplitudes onto the superposition states. Recently, a comparison-based state preparation method was proposed to reduce computational complexity by avoiding rotation operations. One critical aspect of this method is the generation of the comparison threshold associated with the amplitude of the quantum superposition states. The direct computation of the comparison threshold is often very costly. An alternative is to estimate the threshold with a Taylor approximation. However, Taylor approximations do not work well with heavy-tailed distribution functions such as the Cauchy distribution, which is widely used in applications such as financial modeling. Therefore, a new state preparation method needs to be developed. In this study, an efficient comparison-based state preparation method is proposed for the heavy-tailed Cauchy distribution. Instead of a single Taylor approximation for the entire function domain, this study uses quantum piecewise arithmetic to increase accuracy and reduce computational cost. The proposed piecewise function is in the simplest form to estimate the comparison threshold associated with the amplitudes. Numerical analysis shows that the number of required subdomains increases linearly as the maximum tolerated approximation error decreases exponentially. 197 subdomains are required to keep the error below 1 8192 of the maximum amplitude. Quantum parallelism ensures that the computational complexity of estimating the amplitudes is independent from the number of subdomains. [ABSTRACT FROM AUTHOR]

Several phenomena encountered in nature are characterized by very localized events occurring randomly at given times. Random pulses are an appropriate modelling tool for such events. Usually, the impulses are hidden in the noise due to unwanted convolution. In some cases, the problem is more complex because of the short time lag between the pulses. Considering these problems, the resulting signal is unclear and can lead to an erroneous analysis. Hence the need for deconvolution to restore the pulsed signal in order to obtain a more accurate diagnosis. The main objective of this study is to propose a new algorithm called orthogonal least absolute value. The particularity of this algorithm lies in its selection criterion. The algorithm iteratively selects the atom minimizing the absolute value of the approximation error. This allows the proposed algorithm to outperform classical greedy algorithms when the peaks are very close to each other. Numerical and experimental simulations are performed to study the proposed algorithm and compare its behavior to other greedy algorithms in deconvolution framework. Simulations results prove the performance of the proposed algorithm, especially when the impulses are very close to each other. [ABSTRACT FROM AUTHOR]

• Reviews the existing surface remeshing techniques evolved during the last decade that attempt to solve surface remeshing as an optimization problem and achieve the balance between the typical goals of surface remeshing. • Analyzes the performance parameters of existing surface remeshing techniques. • Identifies the drawbacks in the existing techniques. • Suggests a few improvements in the techniques to enhance the results. Direct triangular surface remeshing algorithms work directly on the surface meshes without involving any complex parameterization techniques. The typical goal of surface remeshing is to find a mesh that is a faithful approximation of the input mesh that maintains the geometric fidelity between input and output meshes, achieve a lower bound on the minimal angles to enhance high element quality while maintaining vertex regularity and sharp feature preservation of the input mesh. The goal of each surface remeshing algorithm varies as per the requirement of the end application and thus achieving a balance between all common goals is a challenging task in remeshing. In this paper, a survey of numerous direct surface remeshing algorithms that have been developed over the past decade is presented. A framework of direct surface remeshing is defined and various phases of the framework are discussed in detail to give new insights into both existing methods and issues. A detailed analysis of how significant challenges have already been overcome and promising perspectives of various methods are presented. [ABSTRACT FROM AUTHOR]

In this paper, we consider the iterative algorithm for a boundary value problem of n -order fractional differential equation with mixed integral and multipoint boundary conditions. Using an iterative technique, we derive an existence result of the uniqueness of the positive solution, then construct the iterative scheme to approximate the positive solution of the equation, and further establish some numerical results on the estimation of the convergence rate and the approximation error. [ABSTRACT FROM AUTHOR]

We present goal-oriented a posteriori error estimates for the automatic variationally stable finite element (AVS-FE) method (Calo et al., 2020) for scalar-valued convection–diffusion problems. The AVS-FE method is a Petrov–Galerkin method in which the test space is broken, whereas the trial space consists of classical FE basis functions, e.g., C 0 or Raviart–Thomas functions. We employ the concept of optimal test functions of the discontinuous Petrov–Galerkin (DPG) method by Demkowicz and Gopalakrishnan (Demkowicz and Gopalakrishnan, 2010; Carstensen et al., 2014; Demkowicz and Gopalakrishnan, 2011a; Demkowicz and Gopalakrishnan, 2011b; Demkowicz and Gopalakrishnan, 2012), leading to unconditionally stable FE approximations. Remarkably, by using C 0 or Raviart–Thomas trial spaces, the optimal discontinuous test functions can be computed in a completely decoupled element-by-element fashion. To establish the error estimators we present two approaches: (i) following the classical approach of Becker and Rannacher (Becker and Rannacher, 2001), i.e., the dual solution is sought in the (broken) test space, and (ii) introducing an alternative approach in which we seek C 0 , or Raviart–Thomas, AVS-FE approximations of the dual solution by using the underlying strong form of the dual boundary value problem (BVP). Various numerical verifications for 2D convection-dominated diffusion BVPs show that the estimates of the approximation error by the new alternative method are highly accurate, while the classical approach leads to error estimates of poor quality. Lastly, we present an algorithm for h -adaptive processes based on control of the numerical approximation error via the new alternative approach. Numerical verifications show that the estimator maintains high accuracy as the error converges to zero. [ABSTRACT FROM AUTHOR]

Virtual reference feedback tuning is one of data-driven control method, as only input–output data are used to design two degrees of freedom controller directly, i.e. feed-forward and feedback controller. Given two desired closed-loop transfer functions, virtual input and virtual disturbance are constructed, respectively to obtain one cost function, whose decision variables correspond to the two unknown controller parameters. Then after formulating the cost function as a linear regression form, the classical least squares algorithm is applied to identify the unknown parameter estimators. To quantify the quality or approximation error of the parameter estimators, statistical accuracy analysis is studied for virtual reference feedback tuning control. The detailed computational process about the asymptotic variance matrix is given by using some knowledge from probability theory and matrix theory. Based on our obtained asymptotic variance matrix, two applications of optimal input design and model structure validation are used to illustrate how to use the obtained asymptotic variance matrix. Finally, one simulation example has been performed to demonstrate the effectiveness of the theories proposed in this paper. [ABSTRACT FROM AUTHOR]

We propose and analyze a generalized splitting method to sample approximately from a distribution conditional on the occurrence of a rare event. This has important applications in a variety of contexts in operations research, engineering, and computational statistics. The method uses independent trials starting from a single particle. We exploit this independence to obtain asymptotic and nonasymptotic bounds on the total variation error of the sampler. Our main finding is that the approximation error depends crucially on the relative variability of the number of points produced by the splitting algorithm in one run and that this relative variability can be readily estimated via simulation. We illustrate the relevance of the proposed method on an application in which one needs to sample (approximately) from an intractable posterior density in Bayesian inference. [ABSTRACT FROM AUTHOR]

This article develops a brand new technique to perform safety monitoring using images for a type of complex industrial processes. The new safety monitoring technique is developed with the aid of a modified nonnegative matrix factorization (NMF) algorithm that is called multiple-centroid strictly convex nonnegative matrix factorization (MCSCNMF). Specifically, MCSCNMF is designed deliberately in an all-new manner such that it can learn more accurate centroids for each group of samples than the existing NMF-like algorithms. Moreover, MCSCNMF takes advantage of multiple centroids instead of single centroid to describe the complicated distribution of each type of samples. Both properties give MCSCNMF a powerful clustering performance and make it beneficial for developing high-performance safety monitoring techniques than the existing NMF-like algorithms. We compare different types of monitoring methods in terms of false negative, false positive, and average approximation error in an experiment on a steel coil painting process. Comparison results demonstrate that the MCSCNMF-based monitoring technique can obtain the best experimental results compared with other monitoring methods all the time. [ABSTRACT FROM AUTHOR]

We consider a linear elliptic partial differential equation (PDE) with a generic uniformly bounded parametric coefficient. The solution to this PDE problem is approximated in the framework of stochastic Galerkin finite element methods. We perform a posteriori error analysis of Galerkin approximations and derive a reliable and efficient estimate for the energy error in these approximations. Practical versions of this error estimate are discussed and tested numerically for a model problem with non-affine parametric representation of the coefficient. Furthermore, we use the error reduction indicators derived from spatial and parametric error estimators to guide an adaptive solution algorithm for the given parametric PDE problem. The performance of the adaptive algorithm is tested numerically for model problems with two different non-affine parametric representations of the coefficient. [ABSTRACT FROM AUTHOR]

This paper presents a new methodology to accurately obtain 3D rotational velocities of blocks and fragments. Four high speed cameras are used to capture the scene. An additional two tilted mirrors are used to multiply the number of views. Hence, a total of six different viewing perspectives can be used to track translational and rotational velocities in 3D. The focus in the current work is on the rotational velocities, as tracking of the translation is generally straightforward. A common outline tracking algorithm based on the visual hull is adapted. The visual hull is further meshed using triangular elements to approximate the shape of the object. This 3D reconstruction is then used to track the 3D motion of the object. However, the accuracy of the results strongly depends on the accuracy of the 3D reconstruction which is mainly influenced by the number and position of the available views. In any case, the 3D reconstruction from the visual hull is only an approximation and significant errors can be introduced which influence the tracking accuracy. Hence, an in-house post-processing algorithm based on the knowledge of the real geometry of the object, which can generally be accurately determined after a test, was developed. The improved performance of this new post-processing method is shown by controlled spinning tests. Finally, results of a real example of an impact fragmentation test are discussed. [ABSTRACT FROM AUTHOR]

Two popular approaches to dimensionality reduction are principal component analysis, which projects onto a small number of well-chosen but non-interpretable directions, and feature selection, which selects a small number of the original features. Feature selection can be abstracted as selecting the subset of columns of a matrix X 2 RNd which minimize the approximation error, i.e., the norm of the residual after projecting X onto the space spanned by the selected columns. Such a combinatorial optimization is usually impractical, and there has been interest in polynomial-cost, random subset selection algorithms that favour small values of this approximation error. We propose sampling from a projection determinantal point process, a repulsive distribution over column indices that favours diversity among the selected columns. We bound the ratio of the expected approximation error over the optimal error of PCA. These bounds improve over the state-of-the-art bounds of volume sampling when some realistic structural assumptions are satisfied for X. Numerical experiments suggest that our bounds are tight, and that our algorithms have comparable performance with the double phase algorithm, often considered the practical state-of-the-art. [ABSTRACT FROM AUTHOR]

We establish error estimates for the Longstaff–Schwartz algorithm, employing just a single set of independent Monte Carlo sample paths that is reused for all exercise time steps. We obtain, within the context of financial derivative payoff functions bounded according to the uniform norm, new bounds on the stochastic part of the error of this algorithm for an approximation architecture that may be any arbitrary set of L2 functions of finite Vapnik–Chervonenkis (VC) dimension whenever the algorithm's least-squares regression optimization step is solved either exactly or approximately. Moreover, we show how to extend these estimates to the case of payoff functions bounded only in Lp, p a real number greater than 2 < p < ∞. We also establish new overall error bounds for the Longstaff–Schwartz algorithm, including estimates on the approximation error also for unconstrained linear, finite-dimensional polynomial approximation. Our results here extend those in the literature by not imposing any uniform boundedness condition on the approximation architectures, allowing each of them to be any set of L2 functions of finite VC dimension and by establishing error estimates as well in the case of ɛ-additive approximate least-squares optimization, ɛ greater than or equal to 0. [ABSTRACT FROM AUTHOR]

This paper describes a framework for capturing geological structures in a 3D block model and improving its spatial fidelity, including the correction of stratigraphic, mineralization, and other types of boundaries, given new mesh surfaces. Using surfaces that represent geological boundaries, the objectives are to identify areas where refinement is needed, increase spatial resolution to minimize surface approximation error, reduce redundancy to increase the compactness of the model and identify the geological domain on a block-by-block basis. These objectives are fulfilled by four system components which perform block-surface overlap detection, spatial structure decomposition, sub-blocks consolidation, and block tagging, respectively. The main contributions are a coordinate-ascent merging algorithm and a flexible architecture for updating the spatial structure of a block model when given multiple surfaces, which emphasizes the ability to selectively retain or modify previously assigned block labels. The techniques employed include block-surface intersection analysis based on the separable axis theorem and ray-tracing for establishing the location of blocks relative to surfaces. To demonstrate the robustness and applicability of the proposed block merging strategy in a more narrow setting, it is used to reduce block fragmentation in an existing model where surfaces are not given and the minimum block size is fixed. To obtain further insight, a systematic comparison with octree subblocking subsequently illustrates the inherent constraints of dyadic hierarchical decomposition and the importance of inter-scale merging. The results show the proposed method produces merged blocks with less extreme aspect ratios and is highly amenable to parallel processing. The overall framework is applicable to orebody modeling given geological boundaries, and 3D segmentation more generally, where there is a need to delineate spatial regions using mesh surfaces within a block model. [ABSTRACT FROM AUTHOR]

The horseshoe prior is frequently employed in Bayesian analysis of high-dimensional models, and has been shown to achieve minimax optimal risk properties when the truth is sparse. While optimization-based algorithms for the extremely popular Lasso and elastic net procedures can scale to dimension in the hundreds of thousands, algorithms for the horseshoe that use Markov chain Monte Carlo (MCMC) for computation are limited to problems an order of magnitude smaller. This is due to high computational cost per step and growth of the variance of time-averaging estimators as a function of dimension. We propose two new MCMC algorithms for computation in these models that have significantly improved performance compared to existing alternatives. One of the algorithms also approximates an expensive matrix product to give orders of magnitude speedup in high-dimensional applications. We prove guarantees for the accuracy of the approximate algorithm, and show that gradually decreasing the approximation error as the chain extends results in an exact algorithm. The scalability of the algorithm is illustrated in simulations with problem size as large as N=5,000 observations and p=50,000 predictors, and an application to a genome-wide association study with N=2,267 and p=98,385. The empirical results also show that the new algorithm yields estimates with lower mean squared error, intervals with better coverage, and elucidates features of the posterior that were often missed by previous algorithms in high dimensions, including bimodality of posterior marginals indicating uncertainty about which covariates belong in the model. [ABSTRACT FROM AUTHOR]

High-accuracy on-line contouring error estimation plays a significant role in contouring accuracy control of multi-axis CNC machining. This paper focuses on developing a high-accuracy on-line estimation algorithm of five-axis contouring errors based on three-point arc approximation (TPAA). The nearest reference tool tip position related to the actual one is searched at first, then the tool tip position contouring error is estimated by the distance between the actual position and the arc formed by the nearest reference tool tip position and its two adjacent reference positions. Similar to the tool tip position, the TPAA algorithm is also conducted to estimate the tool orientation contouring error in the unit spherical coordinate system, where equal proportional factors of the tool tip position and the tool orientation arc-lengths are adopted to ensure the synchronization of the tool tip position contouring error and the tool orientation contouring error. The proposed contouring error estimation algorithm is adapted to different trajectory types and has higher estimation accuracy than linear segment approximation (LSA) algorithm for trajectory segments with high curvature. Various experiments with different testing tool paths are performed on an in-house developed five-axis experiment platform to verify the effectiveness of the proposed algorithm, and the results show that the proposed TPAA algorithm can estimate contouring errors with higher accuracy than existing algorithms based on the curvature arc iterative (CAI) algorithm and the LSA algorithm. [ABSTRACT FROM AUTHOR]

For the problem of distance evaluation from a point X 0 to an ellipse in R 2 and to an ellipsoid in R 3 given by algebraic equation G ( X ) = 0 , we investigate the properties of the distance equation , i.e. an algebraic equation whose zeros coincide with the critical values of the squared distance function. We detail the structure of this equation and an algorithm for finding the point in the quadric nearest to X 0 . We also find analytical formulas for distance approximations using the expansion of the zero of distance equation into power series ∑ j = 1 ∞ ℓ j G j ( X 0 ) . Exact values for the approximation error bounds are obtained via construction of an analogue of the distance equations for the curve-to-curve distance problem. [ABSTRACT FROM AUTHOR]

Particle filters are broadly used to approximate posterior distributions of hidden states in state-space models by means of sets of weighted particles. While the convergence of the filter is guaranteed when the number of particles tends to infinity, the quality of the approximation is usually unknown but strongly dependent on the number of particles. In this paper, we propose a novel method for assessing the convergence of particle filters in an online manner, as well as a simple scheme for the online adaptation of the number of particles based on the convergence assessment. The method is based on a sequential comparison between the actual observations and their predictive probability distributions approximated by the filter. We provide a rigorous theoretical analysis of the proposed methodology and, as an example of its practical use, we present simulations of a simple algorithm for the dynamic and online adaptation of the number of particles during the operation of a particle filter on a stochastic version of the Lorenz 63 system. [ABSTRACT FROM PUBLISHER]

We present a simple procedure for modeling shapes and trajectories of points using cubic polynomial splines. The procedure may prove useful for researchers working in the field of pattern recognition that are in the search of a simple functional representation for shapes and which are not particularly interested in diving into the hightheoretical aspects of more complex representations. The use of splines brings in a few advantages with regards to data dimensionality, speed and accuracy of processing, with minimal effort required for the implementation part. We describe several algorithms for data reduction, spline creation and query for which we provide pseudo code procedures in order to demonstrate the ease of implementation. We equally provide measurements on the approximation error and rate of data reduction.

Designing and implementing systems as an interconnection of smaller subsystems is a common practice for modularity and standardization of components and design algorithms. Although not typically cast in this framework, many of these approaches can be viewed within the mathematical context of functional composition. This paper re-interprets and generalizes within the functional composition framework one such approach known as filter sharpening, i.e., interconnecting filter modules which have significant approximation error in order to obtain improved filter characteristics. More specifically, filter sharpening is approached by determining the composing polynomial to minimize the infinity-norm of the approximation error, utilizing the First Algorithm of Remez. This is applied both to sharpening for FIR, even-symmetric filters and for the more general case of subfilters that have complex-valued frequency responses including causal IIR filters and for continuous-time filters. Within the framework of functional composition, this paper also explores the use of functional decomposition to approximate a desired system as a composition of simpler functions based on a two-norm on the approximation error. Among the potential advantages of this decomposition is the ability for modular implementation in which the inner component of the functional decomposition represents the subfilters and the outer the interconnection. [ABSTRACT FROM AUTHOR]

Linear phase is an important characteristic of digital filters in many signal processing applications. In this paper, two iterative reweighted minimax phase error algorithms are proposed to design nearly linear-phase infinite impulse response (IIR) digital filters with prescribed or simultaneously minimized magnitude errors and preset transition-band gain. In each iteration of the algorithms, a weighted minimax phase error problem with a fixed weight function is firstly solved using a modified Gauss-Newton method with a variable step length, and the weight function of the phase error is then updated using the square root of a modified envelope of the group-delay error of the filter. With the proposed methods, both very small phase error and group-delay error have been obtained while meeting the requirements on the passband and stopband magnitude errors and the transition-band gain. Design examples demonstrate the effectiveness of the proposed methods and the excellent performance of the designed filters. [ABSTRACT FROM PUBLISHER]

Several convex formulation methods have been proposed previously for statistical estimation with structured sparsity as the prior. These methods often require a carefully tuned regularization parameter, often a cumbersome or heuristic exercise. Furthermore, the estimate that these methods produce might not belong to the desired sparsity model, albeit accurately approximating the true parameter. Therefore, greedy-type algorithms could often be more desirable in estimating structured-sparse parameters. So far, these greedy methods have mostly focused on linear statistical models. In this paper, we study the projected gradient descent with a non-convex structured-sparse parameter model as the constraint set. Should the cost function have a stable model-restricted Hessian, the algorithm produces an approximation for the desired minimizer. As an example, we elaborate on application of the main results to estimation in generalized linear models. [ABSTRACT FROM AUTHOR]

In Part I of the study of the tensor deflation for CANDECOMP/PARAFAC, we have shown that the rank-1 tensor deflation is applicable under some conditions. Part II of the study presents several initialization algorithms suitable for the algorithm proposed in Part I. In addition, Part II contains an algorithm for the case when one or more factor matrices in the estimated model is constrained to be orthogonal. Finally, Part II provides an error analysis of the tensor deflation algorithm, which shows that there is a marginal loss of accuracy of the deflation algorithm compared to the ordinary CP decomposition. [ABSTRACT FROM PUBLISHER]

When the precise model of a controlled system is difficult to obtain, a model-free control method is suitable for control system design. The design goal of this paper is to propose a more efficient control method to deal with control systems with unknown system dynamic models and to achieve favorable chattering-free trajectory tracking performance. The cerebellar model articulation controller (CMAC) is an efficient neural network that can be applied for model-free control systems. This study proposes an adaptive dynamic sliding-mode fuzzy CMAC (ADSFC) system, which is comprised of a fuzzy CMAC and a fuzzy compensator. A fuzzy CMAC using an asymmetric Gaussian membership function is the main controller and the fuzzy compensator can compensate the approximation error introduced by a fuzzy CMAC. Moreover, a proportional–integral-type adaptation learning algorithm is developed to speed up the parameter learning. Finally, the proposed ADSFC system is applied to control a voice coil motor (VCM). Finally, the experimental results demonstrate the effectiveness of the proposed ADSFC scheme. [ABSTRACT FROM PUBLISHER]

Abstract: We present the first algorithm for approximating weighted geodesic distances on 2-manifolds in . Our algorithm works on a weighted ε-sample S of the underlying manifold and computes approximate geodesic distances between all pairs of points in S. The approximation error is multiplicative and depends on the density of the sample. The algorithm has a running time of and an optimal space requirement of ; the approximation error is bounded by . As a result of independent and possibly practical interest, we develop the first technique to efficiently approximate the sampling density ε of S; this algorithm naturally carries over to the unweighted case. [Copyright &y& Elsevier]

We present a method for real-time computation of clothoid coordinates that guarantees bounded approximation error over a wide range of clothoid parameters provided that the clothoid’s orientation change and length are bounded. It is shown that coordinates of clothoid with any parameters can be computed from those of a single clothoid (with fixed parameters), using appropriate geometrical transformations. A comprehensive analysis is given on how to determine a required set of clothoids and, based on this, how to sample a clothoid in a lookup table in order to achieve required approximation precision. The algorithm is computationally very efficient and therefore suitable for real-time path planning, as well as for other applications that benefit from fast clothoid computation. [ABSTRACT FROM PUBLISHER]

The article focuses on low rank approximation problem and presents an algorithm for computing a low rank approximation by achieving an error which is proportional to the Frobenius norm. Topics discussed include interpreting the Frobenius low rank problem, a lemma that is, a helping theorem related to approximation in Frobenius norm in the row space of a matrix with orthonormal rows and subspace embedding for fixed dimensional subspace.