Search

An issue for molecular dynamics simulations is that events of interest often involve timescales that are much longer than the simulation time step, which is set by the fastest timescales of the model. Because of this timescale separation, direct simulation of many events is prohibitively computationally costly. This issue can be overcome by aggregating information from many relatively short simulations that sample segments of trajectories involving events of interest. This is the strategy of Markov state models (MSMs) and related approaches, but such methods suffer from approximation error because the variables defining the states generally do not capture the dynamics fully. By contrast, once converged, the weighted ensemble (WE) method aggregates information from trajectory segments so as to yield unbiased estimates of both thermodynamic and kinetic statistics. Unfortunately, errors decay no faster than unbiased simulation in WE as originally formulated and commonly deployed. Here, we introduce a theoretical framework for describing WE that shows that the introduction of an approximate stationary distribution on top of the stratification, as in nonequilibrium umbrella sampling (NEUS), accelerates convergence. Building on ideas from MSMs and related methods, we generalize the NEUS approach in such a way that the approximation error can be reduced systematically. We show that the improved algorithm can decrease the simulation time required to achieve the desired precision by orders of magnitude. [ABSTRACT FROM AUTHOR]

It is shown that the four-component (4C), quasi-four-component (Q4C), and exact two-component (X2C) relativistic Hartree–Fock equations can be implemented in a unified manner by making use of the atomic nature of the small components of molecular 4-spinors. A model density matrix approximation can first be invoked for the small-component charge/current density functions, which gives rise to a static, pre-molecular mean field to be combined with the one-electron term. As a result, only the nonrelativistic-like two-electron term of the 4C/Q4C/X2C Fock matrix needs to be updated during the iterations. A "one-center small-component" approximation can then be invoked in the evaluation of relativistic integrals, that is, all atom-centered small-component basis functions are regarded as extremely localized near the position of the atom to which they belong such that they have vanishing overlaps with all small- or large-component functions centered at other nuclei. Under these approximations, the 4C, Q4C, and X2C mean-field and many-electron Hamiltonians share precisely the same structure and accuracy. Beyond these is the effective quantum electrodynamics Hamiltonian that can be constructed in the same way. Such approximations lead to errors that are orders of magnitude smaller than other sources of errors (e.g., truncation errors in the one- and many-particle bases as well as uncertainties of experimental measurements) and are, hence, safe to use for whatever purposes. The quaternion forms of the 4C, Q4C, and X2C equations are also presented in the most general way, based on which the corresponding Kramers-restricted open-shell variants are formulated for "high-spin" open-shell systems. [ABSTRACT FROM AUTHOR]

Estimating ranks, quantiles, and distributions over streaming data is a central task in data analysis and monitoring. Given a stream of n items from a data universe equipped with a total order, the task is to compute a sketch (data structure) of size polylogarithmic in n. Given the sketch and a query item y, one should be able to approximate its rank in the stream, i.e., the number of stream elements smaller than or equal to y. Most works to date focused on additive εn error approximation, culminating in the KLL sketch that achieved optimal asymptotic behavior. This article investigates multiplicative (1±ε )-error approximations to the rank. Practical motivation for multiplicative error stems from demands to understand the tails of distributions, and hence for sketches to be more accurate near extreme values. The most space-efficient algorithms due to prior work store either O(log(ε²n)/ε²) or O(log³ (εn)/ε ) universe items. We present a randomized sketch storing O(log1.5 (εn)/ε ) items that can (1 ± ε )-approximate the rank of each universe item with high constant probability; this space bound is within an O(√log(εn)) factor of optimal. Our algorithm does not require prior knowledge of the stream length and is fully mergeable, rendering it suitable for parallel and distributed computing environments. [ABSTRACT FROM AUTHOR]

This paper deals with the approximation error of trigonometric interpolation for multivariate functions of bounded variation in the sense of Hardy-Krause. We propose interpolation operators related to both the tensor product and sparse grids on the multivariate torus. For these interpolation processes, we investigate the corresponding error estimates in the Lp norm for the class of functions under consideration. In addition, we compare the accuracy with the cardinality of these grids in both approaches. [ABSTRACT FROM AUTHOR]

In this paper, we propose an accurate and controllable rendering process for implicit surfaces with no or unknown analytic Lipschitz constants. Our process is built upon a ray-casting approach where we construct an adaptive Chebyshev proxy along each ray to perform an accurate intersection test via a robust and multi-stage searching method. By taking into account approximation errors and numerical conditions, our methods comprise several pre-conditioning and post-processing stages to improve the numerical accuracy, which potentially applied recursively. The intersection search is performed by evaluating a QR decomposition on the Chebyshev proxy function, which can be done in a numerically accurate way. Our process achieves comparable accuracy to other techniques that impose more constraints on the surface, e.g., knowledge of Lipschitz constants, and higher accuracy compared to approaches that impose similar constraints as our approach. [ABSTRACT FROM AUTHOR]

The composition of solid solutions in the KNd(SO4)2·H2O–SrSO4·0.5H2O system, synthesized from aqueous solutions of KCl, NdCl3, SrCl2, and H2SO4, was studied by X-ray fluorescence spectrometry. Coefficients of calibration dependences for intensity vs. element concentrations were calculated for Nd, Sr, and K by the least-squares technique. A linear approximation function was used in determining potassium and a parabolic approximation function was recommended in determining neodymium and strontium. The obtained dependences are characterized by low (<1%) relative approximation errors. In the analytical ranges (wt %) for K 0.863−8.892, Sr 8.41−38.03, and Nd 5.296−29.30, the standard deviations were 0.012−0.028, 0.008−0.098, and 0.05−0.27 respectively. [ABSTRACT FROM AUTHOR]

We derive rigorous bounds on the error resulting from the approximation of the solution of parametric hyperbolic scalar conservation laws with ReLU neural networks. We show that the approximation error can be made as small as desired with ReLU neural networks that overcome the curse of dimensionality. In addition, we provide an explicit upper bound on the generalization error in terms of the training error, number of training samples and the neural network size. The theoretical results are illustrated by numerical experiments. [ABSTRACT FROM AUTHOR]

We study the approximation and quadrature error of points that satisfy Marcinkiewicz-Zygmund inequalities. First, we investigate the use of Marcinkiewicz-Zygmund inequalities in an abstract Hilbert space for an abstract approximation and quadrature rule. The setting is then specified to Sobolev spaces induced by Freud weights e^{-2\sigma |x|^\alpha } with \alpha >1 and \sigma >0, and we derive specific bounds for the approximation and quadrature error. For the Gaussian weight e^{-2\pi x^2}, we verify that the Sobolev spaces essentially coincide with a specific class of modulation spaces that are well known in (time-frequency) analysis. [ABSTRACT FROM AUTHOR]

Model-based derivative-free optimization (DFO) methods are an important class of DFO methods that are known to struggle with solving high-dimensional optimization problems. Recent research has shown that incorporating random subspaces into model-based DFO methods has the potential to improve their performance on high-dimensional problems. However, most of the current theoretical and practical results are based on linear approximation models due to the complexity of quadratic approximation models. This paper proposes a random subspace trust-region algorithm based on quadratic approximations. Unlike most of its precursors, this algorithm does not require any special form of objective function. We study the geometry of sample sets, the error bounds for approximations, and the quality of subspaces. In particular, we provide a technique to construct Q-fully quadratic models, which is easy to analyze and implement. We present an almost-sure global convergence result of our algorithm and give an upper bound on the expected number of iterations to find a sufficiently small gradient. We also develop numerical experiments to compare the performance of our algorithm using both linear and quadratic approximation models. The numerical results demonstrate the strengths and weaknesses of using quadratic approximations. [ABSTRACT FROM AUTHOR]

This paper is concerned with the finite‐time tracking control problem of fractional‐order nonlinear systems (FONSs) with uncertainty and external disturbance. A novel design scheme of the adaptive neural network finite‐time controller (ANNFTC) is developed by utilizing the theory of finite‐time stability and fractional‐order dynamic surface control (DSC) scheme combined with backstepping method. Radial basis function neural networks (RBF NNs) are employed to estimate the unknown nonlinear function. Furthermore, an auxiliary function is introduced to approximate the unknown upper bounds of the approximation error in RBF NNs and external disturbance. The ANNFTC ensures the finite‐time boundedness of all signals in FONSs and enhances the system output's tracking performance. The effectiveness of the proposed approach is demonstrated through a simulation example, providing empirical evidence to support the theoretical framework presented in this paper. [ABSTRACT FROM AUTHOR]

ABSTRACT This article investigates the optimal control problem (OCP) for a class of discrete‐time nonlinear systems with state constraints. First, to overcome the challenge caused by the constraints, the original constrained OCP is transformed into an unconstrained OCP by utilizing the system transformation technique. Second, a new cost function is designed to alleviate the effect of system transformation on the optimality of the original system. Further, a novel off‐policy deterministic approximate dynamic programming (ADP) scheme is developed to obtain a near‐optimal solution for the transformed OCP. Compared to existing off‐policy deterministic ADP schemes, the developed scheme relaxes the requirement on the learning data and saves computing resources from the perspective of training neural networks. Third, considering approximation errors, we analyze the convergence and stability of the developed ADP scheme. Finally, the developed ADP with the designed cost function is tested in two numerical cases, and simulation results confirm its effectiveness. [ABSTRACT FROM AUTHOR]

We consider a discrete best approximation problem formulated in the framework of tropical algebra, which deals with the theory and applications of algebraic systems with idempotent operations. Given a set of samples of input and output of an unknown function, the problem is to construct a generalized tropical Puiseux polynomial that best approximates the function in the sense of a tropical distance function. The construction of an approximate polynomial involves the evaluation of both unknown coefficient and exponent of each monomial in the polynomial. To solve the approximation problem, we first reduce the problem to an equation in unknown vector of coefficients, which is given by a matrix with entries parameterized by unknown exponents. We derive a best approximate solution of the equation, which yields both vector of coefficients and approximation error parameterized by the exponents. Optimal values of exponents are found by minimization of the approximation error, which is transformed into minimization of a function of exponents over all partitions of a finite set. We solve this minimization problem in terms of max-plus algebra (where addition is defined as maximum and multiplication as arithmetic addition) by using a computational procedure based on the agglomerative clustering technique. This solution is extended to the minimization problem of finding optimal exponents in the polynomial in terms of max-algebra (where addition is defined as maximum). The results obtained are applied to develop new solutions for conventional problems of discrete best Chebyshev approximation of real functions by piecewise linear functions and piecewise Puiseux polynomials. We discuss computational complexity of the proposed solution and estimate upper bounds on the computational time. We demonstrate examples of approximation problems solved in terms of max-plus and max-algebra, and give graphical illustrations. [ABSTRACT FROM AUTHOR]

ABSTRACT In this article, an efficient spectral Galerkin method, which is based on a mixed scheme, is proposed and studied for solving fourth‐order problems in complex regions. The fundamental idea behind this approach is to transform the initial problem into an equivalent form in cylindrical coordinates and to reshape the computational domain into a product‐type rectangular one, which facilitates the utilization of spectral methods. However, when considering the equivalent fourth‐order form directly in cylindrical coordinates, it introduces intricate pole conditions and variable coefficients, posing challenges to both theoretical analysis and algorithm implementation. To address this, we employ the orthogonality of Fourier series to further decompose it into a sequence of decoupled two‐dimensional fourth‐order eigenvalue problems. For each such problem, we introduce an auxiliary function to transform it into an equivalent second‐order coupled system. Building on this, we formulate a mixed variational formulation and discrete scheme, and prove the error estimates for eigenvalue and eigenfunction approximations. Furthermore, we extend this algorithm to the two‐dimensional complex domains. Finally, a series of numerical examples are presented, and the numerical results validate the effectiveness of the algorithm and the correctness of the theoretical results. [ABSTRACT FROM AUTHOR]

ABSTRACT In this article, a neuroadaptive sliding mode control (NSMC) strategy based on recurrent neural network (RNN) for robustly and adaptively tracking the desired position and attitude of an uncertain tilting quadrotor unmanned aerial vehicle (TQUAV) with unknown controllers is presented. The main contribution of this article is the real‐time adjustment of unknown flight controllers using the approximation characteristics of RNN, in which the derived approximation errors of RNN are sufficiently estimated by adaptive control method that can reduce or eliminate the impact of error terms on the evolution of closed‐loop systems. Especially, Lyapunov stability analysis is greatly simplified compared to existing methods and does not require amplification or reduction. Finally, the superior performance of the NSMC strategy was verified by comparing simulation results. [ABSTRACT FROM AUTHOR]

How well can multiple incompatible observables be implemented by a single measurement? This is a fundamental problem in quantum mechanics with wide implications for the performance optimization of numerous tasks in quantum information science. While existing studies have been mostly focusing on the approximation of two observables with a single measurement, in practice multiple observables are often encountered, for which the errors of the approximations are little understood. Here we provide a framework to study the implementation of an arbitrary finite number of observables with a single measurement. Our methodology yields novel analytical bounds on the errors of these implementations, significantly advancing our understanding of this fundamental problem. Additionally, we introduce a more stringent bound utilizing semi-definite programming that, in the context of two observables, generates an analytical bound tighter than previously known bounds. The derived bounds have direct applications in assessing the trade-off between the precision of estimating multiple parameters in quantum metrology, an area with crucial theoretical and practical implications. To validate the validity of our findings, we conducted experimental verification using a superconducting quantum processor. This experimental validation not only confirms the theoretical results but also effectively bridges the gap between the derived bounds and empirical data obtained from real-world experiments. Our work paves the way for optimizing various tasks in quantum information science that involve multiple noncommutative observables. [ABSTRACT FROM AUTHOR]

Estimates of PM 2.5 levels are crucial for monitoring air quality and studying the epidemiological impact of air quality on the population. Currently, the most precise measurements of PM 2.5 are obtained from ground stations, resulting in limited spatial coverage. In this study, we consider satellite-based PM 2.5 retrieval, which involves conversion of high-resolution satellite retrieval of aerosol optical depth (AOD) into high-resolution PM 2.5 retrieval. To improve the accuracy of the AOD-to-PM 2.5 conversion, we employ the machine-learning-based post-process correction to correct the AOD-to-PM conversion ratio derived from Modern-Era Retrospective analysis for Research and Applications, Version 2 (MERRA-2) reanalysis model data. The post-process-correction approach utilizes a fusion and downscaling of satellite observation and retrieval data, MERRA-2 reanalysis data, various high-resolution geographical indicators, meteorological data, and ground station observations for learning a predictor for the approximation error in the AOD-to-PM 2.5 conversion ratio. The corrected conversion ratio is then applied to estimate PM 2.5 levels given the high-resolution satellite AOD retrieval data derived from Sentinel-3 observations. The region of study is central Europe during the year 2019. Our model produces PM 2.5 estimates with a spatial resolution of 100 m at satellite overpass times with R2 = 0.55 and RMSE = 6.2 µ g m -3. The corresponding metrics for monthly averages are R2 = 0.72 and RMSE = 3.7 µ g m -3. Additionally, we have incorporated an ensemble of neural networks to provide error envelopes for machine-learning-related uncertainty in the PM 2.5 estimates. The proposed approach can produce accurate high-resolution PM 2.5 data that can be very useful for air quality monitoring, emission regulation, and epidemiological studies. [ABSTRACT FROM AUTHOR]

AbstractIn this paper, we study the order of approximation for max-product sampling Kantorovich operators based upon generalized kernels in the setting of Orlicz spaces. We establish a quantitative estimate for the considered family of sampling-type operators using the Orlicz-type modulus of smoothness, which involves the modular functional of the space. From this result, it is possible to obtain the qualitative order of convergence when functions belonging to suitable Lipschitz classes are considered. On the other hand, in the compact case, we exploit a suitable definition of K-functional in Orlicz spaces in order to provide an upper bound for the approximation error of the involved operators. The treatment in the general framework of Orlicz spaces allows one to obtain a unifying theory on the rate of convergence, as the proved results can be deduced for a wide range of functional spaces, such as Lp-spaces, interpolation spaces and exponential spaces. [ABSTRACT FROM AUTHOR]

We consider a project portfolio selection problem faced by research councils in project and call-based R &D grant programs. In such programs, typically, each applicant project receives a score value during specially-designed peer review processes. Each project also has a certain budget, estimated by its principle investigator. The problem is to select an optimal (maximum total score) subset of applicant projects under a budget constraint for the call. At the time of funding decisions, exact expenditures of projects are not known. The research councils typically don't provide more money than they funded a project to start with, so the realized total expenditure of a portfolio usually tends to be lower than the total budget, which causes budgetary slack. In this paper, we attempt to model this phenomenon in a project portfolio selection problem and show that budget utilization of a call can be increased to support more projects and hence achieve higher scientific impact. We model a project's expenditure using a mixture distribution that represents project success, underspending and cancellation situations. We develop a chance-constrained model with policy constraints. Due to the intractability of the developed model, we have shown that Normal distribution can be used for approximation. We also quantify the approximation error of our model via a theoretical bound and simulation. The proposed approach could rigorously increase the budget utilization up to 15.2% along with a prominent rise in expected number of successfully completed projects, which are remarkable metrics for public decision makers. [ABSTRACT FROM AUTHOR]

In this paper, a numerical strategy is introduced for solving a class of linear fractional-order Darboux problem that includes the Caputo derivative. The presented strategy is grounded on the Newton-Cotes quadrature rule and is established by implementing Lagrange interpolation polynomial. A formula is developed to evaluate the two-dimensional fractional integrals by using the multiplicative integration strategy. Then, this formula is employed to derive a scheme for solving a class of fractional-order Darboux problem. The accuracy and efficiency of all the presented schemes are illustrated through numerical experiments. Furthermore, the estimation of the upper bounds of error in the numerical approximation for the proposed multiplicative integration strategy is established. [ABSTRACT FROM AUTHOR]

We obtain an expression for the error in the approximation of f(A)b$$ f(A)\boldsymbol{b} $$ and bTf(A)b$$ {\boldsymbol{b}}^Tf(A)\boldsymbol{b} $$ with rational Krylov methods, where A$$ A $$ is a symmetric matrix, b$$ \boldsymbol{b} $$ is a vector and the function f$$ f $$ admits an integral representation. The error expression is obtained by linking the matrix function error with the error in the approximate solution of shifted linear systems using the same rational Krylov subspace, and it can be exploited to derive both a priori and a posteriori error bounds. The error bounds are a generalization of the ones given in Chen et al. for the Lanczos method for matrix functions. A technique that we employ in the rational Krylov context can also be applied to refine the bounds for the Lanczos case. [ABSTRACT FROM AUTHOR]

This paper proposes a Generalized Multilevel B-spline Approximation (GMBA) method, which addresses scattered data interpolation problems in image processing. Mathematically, the GMBA provides a better solution for the B-spline control lattice by superimposing identical level B-splines compared with traditional Multilevel B-spline Approximation (MBA). Specifically, the GMBA allows the spacing of next control lattice to be subdivided arbitrarily or remained unchanged, which is determined by a predefined spacing set or the current error level. These improvements bring higher approximation accuracy and more flexibility for algorithm design to avoid over-fitting. In this paper, basic GMBA algorithm and its refined algorithm are compiled for image processing. Finally, six relevant cases are involved to test the GMBA, including surface approximation, image enlargement, image completion, and Salt-and-Pepper (SAP) noise removal. The experimental results show that the GMBA has better performance than the MBA in surface approximation and image processing, performs comparatively fast with the best performance on more than half of the standard test images compared with traditional algorithms, and has partially better performance even than deep learning algorithms. The GMBA can effectively recover meaningful details in images contaminated with even extremely high SAP noise level (up to 99%). • We give a generalized multilevel B-spline approximation (GMBA) method. • GMBA allows the control spacing to be subdivided arbitrarily or remained unchanged. • GMBA offers higher approximation accuracy and greater flexibility than traditional MBA. • GMBA provides superior performance and less run time than many of the state-of-the-art methods for SAP noise removal. • GMBA can recovery meaningful detail at noise levels as high as 99% for SAP noise removal. [ABSTRACT FROM AUTHOR]

In this paper, we show that Hilbert space-valued stochastic models are robust with respect to perturbations, due to measurement or approximation errors, in the underlying volatility process. Within the class of stochastic-volatility-modulated Ornstein–Uhlenbeck processes, we quantify the error induced by the volatility in terms of perturbations in the parameters of the volatility process. We moreover study the robustness of the volatility process itself with respect to finite-dimensional approximations of the driving compound Poisson process and semigroup generator, respectively, when considering operator-valued Barndorff-Nielsen and Shephard stochastic volatility models. We also give results on square root approximations. In all cases, we provide explicit bounds for the induced error in terms of the approximation of the underlying parameter. We discuss some applications to robustness of prices of options on forwards and volatility. [ABSTRACT FROM AUTHOR]

Purpose: For effective optimization of MR fingerprinting (MRF) pulse sequences, estimating and minimizing errors from actual scan conditions are crucial. Although virtual‐scan simulations offer an approximation to these errors, their computational demands become expensive for high‐dimensional MRF frameworks, where interactions between more than two tissue properties are considered. This complexity makes sequence optimization impractical. We introduce a new mathematical model, the systematic error index (SEI), to address the scalability challenges for high‐dimensional MRF sequence design. Methods: By eliminating the need to perform dictionary matching, the SEI model approximates quantification errors with low computational costs. The SEI model was validated in comparison with virtual‐scan simulations. The SEI model was further applied to optimize three high‐dimensional MRF sequences that quantify two to four tissue properties. The optimized scans were examined in simulations and healthy subjects. Results: The proposed SEI model closely approximated the virtual‐scan simulation outcomes while achieving hundred‐ to thousand‐times acceleration in the computational speed. In both simulation and in vivo experiments, the optimized MRF sequences yield higher measurement accuracy with fewer undersampling artifacts at shorter scan times than the heuristically designed sequences. Conclusion: We developed an efficient method for estimating real‐world errors in MRF scans with high computational efficiency. Our results illustrate that the SEI model could approximate errors both qualitatively and quantitatively. We also proved the practicality of the SEI model of optimizing sequences for high‐dimensional MRF frameworks with manageable computational power. The optimized high‐dimensional MRF scans exhibited enhanced robustness against undersampling and system imperfections with faster scan times. [ABSTRACT FROM AUTHOR]

The paper proposes a general quasi-interpolation scheme for high-dimensional function approximation. To facilitate error analysis, we view our quasi-interpolation as a two-step procedure. In the first step, we approximate a target function by a purpose-built convolution operator (with an error term referred to as convolution error). In the second step, we discretize the underlying convolution operator using certain quadrature rule at the given sampling data sites (with an error term called discretization error). The final approximation error is obtained as an optimally balanced sum of these two errors, which in turn views our quasi-interpolation as a regularization technique that balances convolution error and discretization error. As a concrete example, we construct a sparse grid quasi-interpolation scheme for high-dimensional function approximation. Both theoretical analysis and numerical implementations provide evidence that our quasi-interpolation scheme is robust and is capable of mitigating the curse of dimensionality for approximating high-dimensional functions. [ABSTRACT FROM AUTHOR]

This work focuses on the study of approximation properties of functions by Szász type operators involving Frobenius–Euler–Simsek-type polynomials, which have become more popular recently because of their special characteristics and functional organization. The convergence properties such as uniformly convergence and pointwise convergence in terms of modulus of continuity and Peetre- K functional are investigated with the help of these sequences of operators in depth. This paper also includes the estimation of the error of the approximation of these sequences of operators to some particular class of functions. The estimates are depicted using the Maple scientific computing program and presented in tables. [ABSTRACT FROM AUTHOR]

In the realm of autonomous aerial refueling missions for unmanned aerial vehicles (UAVs), the controllable drogue represents a novel approach that significantly enhances both the safety and efficiency of aerial refueling operations. This paper delves into the issue of wide-range maneuverability control for the controllable drogue. Initially, a dynamic model for the variable-length hose–drogue system is presented. Based on this, a cooperative control framework that synergistically utilizes both the hose and the drogue is designed to achieve wide-range maneuverability of the drogue. To address the delay in hose retrieval and release, an open-loop control strategy based on neural networks is proposed. Furthermore, a closed-loop control method utilizing fuzzy approximation and adaptive error estimation is designed to tackle the challenges posed by modeling inaccuracies and uncertainties in aerodynamic parameters. Comparative simulation results show that the proposed control strategy can make the drogue maneuvering range reach more than 6 m. And it can accurately track the time-varying trajectory under the influence of model uncertainty and wind disturbance with an error of less than 0.1 m throughout. This method provides an effective means for achieving wide-range maneuverability control of the controllable drogue in autonomous aerial refueling missions. [ABSTRACT FROM AUTHOR]

This paper is concerned with finite element approximation for the minimal time optimal control problem $ (\mathcal{TP}) $ of the heat equation with impulse controls at some control instants. To this end, with the aid of Pontryagin's Maximum Principle, we first get the $ H^1- $regularity estimate of the optimal control by making use of the semigroup method and the unique continuation property. Then, following the high order regularity estimate of the optimal control, the error estimate of the optimal time between the original impulse control problem $ (\mathcal{TP}) $ and the semidiscrete impulse control problem $ (\mathcal{TP}_{hl}) $ is established. [ABSTRACT FROM AUTHOR]

In recent years, one-bit quantization has attracted widespread attention in the field of direction-of-arrival (DOA) estimation as a low-cost and low-power solution. Many researchers have proposed various estimation algorithms for one-bit DOA estimation, among which atomic norm minimization algorithms exhibit particularly attractive performance as gridless estimation algorithms. However, current one-bit DOA algorithms with atomic norm minimization typically rely on approximating the trace function, which is not the optimal approximation and introduces errors, along with resolution limitations. To date, there have been few studies on how to enhance resolution under the framework of one-bit DOA estimation. This paper aims to improve the resolution constraints of one-bit DOA estimation. The log-det heuristic is applied to approximate and solve the atomic norm minimization problem. In particular, a reweighted binary atomic norm minimization with noise assumption constraints is proposed to achieve high-resolution and robust one-bit DOA estimation. Finally, the alternating direction method of multipliers algorithm is employed to solve the established optimization problem. Simulations are conducted to demonstrate that the proposed algorithm can effectively enhance the resolution. [ABSTRACT FROM AUTHOR]

In order to ensure the flight safety of small unmanned aerial vehicles (UAVs), a deep neural network-fused mathematical modeling approach is put up for reliable flight control of small UAVs. First, engine torque, thrust eccentricity and initial stop angle are taken into full consideration. A six-degree-of-freedom nonlinear model is formulated for small UAVs, concerning both ground taxiing and air flight status. Then, the model was linearized using the principle of small disturbances. The linearized model expressions for both ground taxiing and air flight were provided. In addition, radial basis function neural networks are used for online approximation to address the nonlinearity and uncertainty caused by changes in aircraft aerodynamic parameters. At the same time, to compensate for the external disturbance and the approximation error of the neural network, the system robustness is improved by selecting reasonable design parameters. This helps the whole flight control system obtain better tracking control performance. At last, some simulation experiments are carried out to evaluate the performance of the proposed mathematical modeling framework. The simulation results show that the proposal has stronger convergence ability, smaller prediction error, and better performance. Thus, proper proactivity can be acknowledged. [ABSTRACT FROM AUTHOR]

This paper presents a numerical comparison of finite-element methods resulting in local mass conservation at the element level for Poisson's problem, namely the primal hybrid and mixed methods. These formulations result in an indefinite system. Alternative formulations yielding a positive-definite system are obtained after hybridizing each method. The choice of approximation spaces yields methods with enhanced accuracy for the pressure variable, and results in systems with identical size and structure after static condensation. A regular pressure precision mixed formulation is also considered based on the classical RT k space. The simulations are accelerated using Open multi-processing (OMP) and Thread-Building Blocks (TBB) multithreading paradigms alongside either a coloring strategy or atomic operations ensuring a thread-safe execution. An additional parallel strategy is developed using C++ threads, which is based on the producer-consumer paradigm, and uses locks and semaphores as synchronization primitives. Numerical tests show the optimal parallel strategy for these finite-element formulations, and the computational performance of the methods are compared in terms of simulation time and approximation errors. Additional results are developed during the process. Numerical solvers often fail to find an accurate solution to the highly indefinite systems arising from finite-element formulations, and this paper documents a matrix ordering strategy to stabilize the resolution. A procedure to enable static condensation based on the introduction of piecewise constant functions that also fulfills Neumann's compatibility condition, and yet computes an average pressure per element is presented. • Numerical comparison of the mixed, primal hybrid, and other locally conservatives finite element methods. • Introduction of a twice hybridized primal hybrid method, yielding a positive definite matrix after static condensation. • Comparison of multi-threaded strategies and thread-safety mechanisms. • A numerical procedure to stabilize the linear system resolution for indefinite matrices is described. • A general procedure that enables static condensation and fulfills Neumann's compatibility condition. [ABSTRACT FROM AUTHOR]

For the first time, we propose an efficient difference spectral approximation for Allen–Cahn equation in a circular domain. Firstly, we introduce the polar coordinate transformation and derive the equivalent form of Allen–Cahn equation under this coordinate system, as well as the corresponding essential polar condition. Then, by using first‐order Euler and second‐order backward difference methods in the temporal direction, we deduce the first‐order and second‐order semi‐implicit schemes, based on which the first‐order and second‐order fully discrete schemes are established by employing Legendre‐Fourier spectral approximation in the spatial direction. In addition, the energy stability and error estimations for the two types of numerical schemes are theoretically proved. Finally, we provide some numerical examples, the results of which demonstrate the stability and convergence of the algorithm. [ABSTRACT FROM AUTHOR]

Objective: This study was to evaluate measurement properties of the Chinese version of the Brief Inventory of Perceived Stress (BIPS-C) and confirm possible solutions for measuring the constructs underlying perceived stress. Methods: A total of 1356 community residents enrolled and were randomly split into two halves. The first half was used to explore the underlying constructs of the BIPS-C by exploratory graph analysis (EGA) and the second half was used to compare and confirm the constructs by confirmatory factor analysis (CFA). Results: The EGA identified a one-factor model of the BIPS-C with an accuracy of 99.3%. One-factor, three-factor, second-order, and bifactor models were compared by CFAs. The bifactor model with one general and three specific factors was found to be the most adequate [comparative fit index (CFI) = 0.990; Tucker-Lewis index (TLI) = 0.979; root mean square error of approximation (RMSEA) = 0.058] and was superior to the other models. The related bifactor indices showed a stronger existence of the general factor. The bifactor model of the BIPS-C also showed adequate internal consistency with McDonald's omega and omega subscales ranging from moderate to strong (0.677–0.869). Conclusion: The BIPS-C demonstrates sufficient measurement properties for assessing general perceived stress. [ABSTRACT FROM AUTHOR]

We consider optimal experimental design (OED) for Bayesian nonlinear inverse problems governed by partial differential equations (PDEs) under model uncertainty. Specifically, we consider inverse problems in which, in addition to the inversion parameters, the governing PDEs include secondary uncertain parameters. We focus on problems with infinite-dimensional inversion and secondary parameters and present a scalable computational framework for optimal design of such problems. The proposed approach enables Bayesian inversion and OED under uncertainty within a unified framework. We build on the Bayesian approximation error (BAE) approach, to incorporate modeling uncertainties in the Bayesian inverse problem, and methods for A-optimal design of infinite-dimensional Bayesian nonlinear inverse problems. Specifically, a Gaussian approximation to the posterior at the maximum a posteriori probability point is used to define an uncertainty aware OED objective that is tractable to evaluate and optimize. In particular, the OED objective can be computed at a cost, in the number of PDE solves, that does not grow with the dimension of the discretized inversion and secondary parameters. The OED problem is formulated as a binary bilevel PDE constrained optimization problem and a greedy algorithm, which provides a pragmatic approach, is used to find optimal designs. We demonstrate the effectiveness of the proposed approach for a model inverse problem governed by an elliptic PDE on a three-dimensional domain. Our computational results also highlight the pitfalls of ignoring modeling uncertainties in the OED and/or inference stages. [ABSTRACT FROM AUTHOR]

This paper proposes an algorithm to obtain the sampling factors to model any frequency partitioning so that it is realized using low complexity rational decimated non-uniform filter banks (RDNUFBs). The proposed algorithm is employed to approximate the Bark scale to find a rational frequency partitioning that can be realized using RDNUFBs with less approximation error. The proposed Bark frequency partitioning is found to reduce the average deviation in centre frequency and bandwidth by 65.04% and 48.50%, respectively, and root-mean-square bandwidth deviation by 54.46% when compared to those of the existing perceptual wavelet approximation of Bark scale. In the first filter bank design approach discussed in the paper, a near-perfect reconstruction partially cosine modulated filter bank is employed to obtain the improved Bark frequency partitioning. In the second design approach, the hardware complexity of the PCM-based RDNUFB is reduced by deriving the channels with different sampling factors from the same prototype filter by the method of channel merging. There is a considerable reduction of 40.83% in the number of multipliers when merging of partially cosine modulated channels is employed. It is also found that both the proposed approaches can reduce the delay by 95.17% when compared to the existing rational tree approximation methods and hence, are suitable for real-time applications. [ABSTRACT FROM AUTHOR]

In this paper, we propose an a posteriori error estimate of the weak Galerkin finite element method (WG‐FEM) solving the Stokes problems with variable coefficients. Its error estimator, based on the property of Stokes' law conservation, Helmholtz decomposition and bubble functions, yields global upper bound and local lower bound for the approximation error of the WG‐FEM. Error analysis is proved to be valid under the mesh assumptions of the WG‐FEM and the way can be extended to other FEMs with the property of Stokes' law conservation, for example, discontinuous Galerkin (DG) FEMs. Finally, we verify the performance of error estimator by performing a few numerical examples. [ABSTRACT FROM AUTHOR]

In the realm of five-axis Computer Numerical Control (CNC) machining, the challenge of minimizing velocity, acceleration, and jerk fluctuations has prompted the development of various local corner smoothing methods. However, existing techniques often rely on symmetrical spline curves or impose pre-set transition length constraints, limiting their effectiveness in reducing curvature and maintaining velocity at critical corners. To comprehensively address these limitations comprehensively, a novel approach for local smoothing of five-axis linear toolpaths is presented in this paper. The proposed method introduces two asymmetrical B-splines at corners, effectively smoothing both the tool-tip position in the workpiece coordinate system and the tool orientation in the machine coordinate system. To fine-tune transition curve scales and minimize velocity disparities between adjacent corners, an overlap elimination scheme is employed. Furthermore, the two-step strategy emphasizes the synchronization of tool-tip position and tool orientation while considering maximal approximation error. The outcome is a blended five-axis toolpath that significantly reduces curvature extremes in the smoothed path, achieving reductions ranging from 36.28 % to 45.51 %. Additionally, the proposed method streamlines the interpolation process, resulting in time savings ranging from 5.68 % to 8.78 %, all the while adhering to the same geometric and kinematic constraints. [ABSTRACT FROM AUTHOR]

To solve some scheduling problems of batch processes based on timed Petri net models, timed extended reachability graphs (TERGs) and approximated TERGs can be used. Such graphs abstract temporal specifications and represent parts of timed languages. By exploring the feasible trajectories in a TERG, optimal schedules can be obtained with respect to the makespans of batch processes that are modeled by timed Petri nets. Nevertheless, the rapid growth of the number of states in a TERG makes the problem intractable for large systems. In this paper, we improve the existing clustering TERG approach, and we make it suitable for large sized batch processes. We also enlarge a systematic approach to model batch processes with timed Petri nets. Finally, a comprehensive example of scheduling problem is studied for an archetypal chemical production plant in order to illustrate the efficiency of the proposed approach. • The scheduling issue of batch chemical processes is formalized with timed Petri nets. • A graph named ClusTERG approximates the state space through hierarchical clustering. • The approximation error of this ClusTERG is far less than other approximations. • Such an approach is used to obtain near-optimal schedules of a batch process. [ABSTRACT FROM AUTHOR]

Reconfigurable variable stiffness actuator (RVSA) has attracted increasing attention in robotics due to its safety, compliance, and robustness. However, the control of the RVSA is challenging due to nonlinear factors such as high-order nonlinear dynamic, model uncertainties, time-varying model parameters, and disturbances. In this paper, firstly, a lightweight RVSA structure with both passive and active nonlinear variable stiffness characteristic is developed. Secondly, a dynamic surface backstepping control method based on a radial basis neural network and disturbance observer (DSBC-RBFNN-DOB) is proposed to achieve position control of the lightweight RVSA with matched and unmatched uncertainties. To address solve the "complexity explosion" and noise problems in traditional backstepping control, the dynamic surface backstepping control (DSBC) method is used to design the controller. Then, a method based on radial basis neural network (RBFNN) and disturbance observer (DOB) are used to compensate for the matched and unmatched uncertainties in the link and motor. In this method, the matched uncertainties are compensated using RBFNN, and the DOB is integrated to compensate RBFNN approximation errors and unmatched uncertainties. Through Lyapunov stability analysis, the semi-global boundedness of the controller is proven. Finally, the proposed method is simulated and actually implemented, verifying the effectiveness of the method. Simulation and experimental results show that the root mean square error (RMSE) of the proposed method is only 0.97277° and 0.6418°, respectively. Compared with PID, DSBC, and DSBC-RBFNN, the error reduction percentages in simulation (experiment) are 85.6 % (88.9 %), 49.4 % (88.4 %) and 36.1 % (80.0 %) respectively. • A lightweight reconfigurable variable stiffness actuator with smaller mass and more compact structure is proposed.. • A dynamic surface backstepping control method based on neural network and disturbance observer is proposed. • A method of uncertainty and disturbance estimation combining neural network and disturbance observer is proposed. • Experiments and simulations were conducted under the condition of actively changing stiffness. [ABSTRACT FROM AUTHOR]

An adaptive predefined-time quantized control issue is considered for strict-feedback systems with actuator quantization. To handle the unknown nonlinearities of a system, the neural networks are first applied to model them. To analyze the predefined-time stability under approximation error, a stability lemma is first introduced. Then, a refreshing predefined-time quantized control strategy is presented. Compared with the existing control studies for actuator quantization, the stability time is not influenced by the initial state and can be set in advance. Furthermore, unlike the available predefined-time control studies, a new parameter adaptive law and virtual controllers are designed. This design not only ensures the predefined-time stability, but overcomes the singularities of system in coventional backstepping control design because of repeating differentiation for virtual controllers. [ABSTRACT FROM AUTHOR]

In this work, we introduce a novel stochastic second-order method, within the framework of a non-monotone trust-region approach, for solving the unconstrained, nonlinear, and non-convex optimization problems arising in the training of deep neural networks. The proposed algorithm makes use of subsampling strategies that yield noisy approximations of the finite sum objective function and its gradient. We introduce an adaptive sample size strategy based on inexpensive additional sampling to control the resulting approximation error. Depending on the estimated progress of the algorithm, this can yield sample size scenarios ranging from mini-batch to full sample functions. We provide convergence analysis for all possible scenarios and show that the proposed method achieves almost sure convergence under standard assumptions for the trust-region framework. We report numerical experiments showing that the proposed algorithm outperforms its state-of-the-art counterpart in deep neural network training for image classification and regression tasks while requiring a significantly smaller number of gradient evaluations. [ABSTRACT FROM AUTHOR]

Studies of lake ice phenology have historically relied on limited in situ data. Relatively few observations exist for ice out and fewer still for ice in, both of which are necessary to determine the temporal extent of ice cover. Satellite data provide an opportunity to better document patterns of ice phenology across landscapes and relate them to the climatological drivers behind changing ice phenology. We developed a model, the Cumulative Sum Method (CSM), that uses daytime and nighttime surface temperature observations from the Moderate Resolution Imaging Spectroradiometer (MODIS) sensor on board the Earth‐observing Aqua satellite to approximate ice in (the onset of ice cover) and ice out from training datasets of 13 and 58 Maine lakes, respectively, during the 2002/2003 through 2017/2018 ice seasons. Ice in was signaled by reaching a threshold of cumulative negative degrees following the first day of the season below 0°C. Ice out was signaled by reaching a threshold of cumulative positive degrees following the first day of the year above 0°C. The comparison of observed and remotely sensed ice‐in dates showed relative agreement with a correlation coefficient of 0.71 and a mean absolute error (MAE) of 9.8 days. Ice‐out approximations had a correlation coefficient of 0.67 and an MAE of 8.8 days. Lakes smaller in surface area and nearer the Atlantic coast had the greatest error in approximation. Application of the CSM to 20 additional lakes in Maine produced a comparable ice‐out MAE of 8.9 days. Ice‐out model performance was weaker for the warmest years; there was a larger MAE of 12.0 days when the model was applied to the years 2019–2023 for the original 58 lakes. The development of this model, which utilizes daily satellite data, demonstrates the promise of remote sensing for quantifying ice phenology over short, temporal scales, and wider geographic regions than can be observed in situ, and allows exploration of the influence of surface temperature patterns on the process and timing of ice in and ice out. [ABSTRACT FROM AUTHOR]

Negative binomial related distributions have been widely used in practice. The calculation of the corresponding Fisher information matrices involves the expectation of trigamma function values which can only be calculated numerically and approximately. In this paper, we propose a trigamma-free approach to approximate the expectations involving the trigamma function, along with theoretical upper bounds for approximation errors. We show by numerical studies that our approach is highly efficient and much more accurate than previous methods. We also apply our approach to compute the Fisher information matrices of zero-inflated negative binomial (ZINB) and beta negative binomial (ZIBNB) probabilistic models, as well as ZIBNB regression models. [ABSTRACT FROM AUTHOR]

Wu and Browne (Psychometrika 80(3):571–600, 2015. https://doi.org/10.1007/s11336-015-9451-3; henceforth W &B) introduced the notion of adventitious error to explicitly take into account approximate goodness of fit of covariance structure models (CSMs). Adventitious error supposes that observed covariance matrices are not directly sampled from a theoretical population covariance matrix but from an operational population covariance matrix. This operational matrix is randomly distorted from the theoretical matrix due to differences in study implementations. W &B showed how adventitious error is linked to the root mean square error of approximation (RMSEA) and how the standard errors (SEs) of parameter estimates are augmented. Our contribution is to consider adventitious error as a general phenomenon and to illustrate its consequences. Using simulations, we illustrate that its impact on SEs can be generalized to pairwise relations between variables beyond the CSM context. Using derivations, we conjecture that heterogeneity of effect sizes across studies and overestimation of statistical power can both be interpreted as stemming from adventitious error. We also show that adventitious error, if it occurs, has an impact on the uncertainty of composite measurement outcomes such as factor scores and summed scores. The results of a simulation study show that the impact on measurement uncertainty is rather small although larger for factor scores than for summed scores. Adventitious error is an assumption about the data generating mechanism; the notion offers a statistical framework for understanding a broad range of phenomena, including approximate fit, varying research findings, heterogeneity of effects, and overestimates of power. [ABSTRACT FROM AUTHOR]

This work introduces a sophisticated impedance-based equivalent circuit model of the electrochemical processes inside a lithium-ion battery cell. The influence on the electrical voltage response is derived and merged into a mathematical calculation framework describing all fundamental phenomena inside a battery. The parameters, whose sole influences on the electric behaviour cannot be separated at the cell level, are summarised to derive a model with purely electrical quantities. We significantly reduce the model order compared to a physicochemical model while ensuring a minimal approximation error. Utilising the findings from the model derivation, we develop a parameterisation procedure to separate the individual processes occurring in the battery and to support a hypothesis of the assignment to positive and negative electrodes based on several indicia. For this purpose, electrochemical impedance spectroscopy and correlation analysis are used to calculate the distribution of the time constants. The final parameterised model has physics-based parameter variations, which ensures that the simulation over broad ranges of temperatures and states of charge results in a reasonable voltage response. The model's physical basis enables extrapolation beyond the measured operation area, and the model verification shows less than a 10 mV root mean square error over a wide range of operations. [ABSTRACT FROM AUTHOR]

The primary focus of this research paper is to explore the realm of dynamic learning in sampled‐data strict‐feedback nonlinear systems (SFNSs) by leveraging the capabilities of radial basis function (RBF) neural networks (NNs) under the framework of adaptive control. First, the exact discrete‐time model of the continuous‐time system is expressed as an Euler strict‐feedback model with a sampling approximation error. We provide the consistency condition that establishes the relationship between the exact model and the Euler model with meticulous detail. Meanwhile, a novel lemma is derived to show the stability condition of a digital first‐order filter. To address the non‐causality issues of SFNSs with sampling approximation error and the input data dimension explosion of NNs, the auxiliary digital first‐order filter and backstepping technology are combined to propose an adaptive neural dynamic surface control (ANDSC) scheme. Such a scheme avoids the n$$ n $$‐step time delays associated with the existing NN updating laws derived by the common n$$ n $$‐step predictor technology. A rigorous recursion method is employed to provide a comprehensive verification of the stability, guaranteeing its overall performance and dependability. Following that, the NN weight error systems are systematically decomposed into a sequence of linear time‐varying subsystems, allowing for a more detailed analysis and understanding. In order to ensure the recurrent nature of the input variables, a recursive design is employed, thereby satisfying the partial persistent excitation condition specifically designed for the RBF NNs. Meanwhile, it can verify that the NN estimated weights converge to their ideal values. Compared with the common n$$ n $$‐step predictor technology, there is no need to redesign the learning rules due to the designed NN weight updating laws without time delays. Subsequently, after capturing and storing the convergence weights, a novel neural learning dynamic surface control (NLDSC) scheme is specifically formulated by leveraging the acquired knowledge. The introduced methodology reduces computational complexity and facilitates practical implementation. Finally, empirical evidence obtained from simulation experiments validates the efficacy and viability of the proposed methodology. [ABSTRACT FROM AUTHOR]

This work considers the low‐rank approximation of a matrix A(t)$$ A(t) $$ depending on a parameter t$$ t $$ in a compact set D⊂ℝd$$ D\subset {\mathbb{R}}^d $$. Application areas that give rise to such problems include computational statistics and dynamical systems. Randomized algorithms are an increasingly popular approach for performing low‐rank approximation and they usually proceed by multiplying the matrix with random dimension reduction matrices (DRMs). Applying such algorithms directly to A(t)$$ A(t) $$ would involve different, independent DRMs for every t$$ t $$, which is not only expensive but also leads to inherently non‐smooth approximations. In this work, we propose to use constant DRMs, that is, A(t)$$ A(t) $$ is multiplied with the same DRM for every t$$ t $$. The resulting parameter‐dependent extensions of two popular randomized algorithms, the randomized singular value decomposition and the generalized Nyström method, are computationally attractive, especially when A(t)$$ A(t) $$ admits an affine linear decomposition with respect to t$$ t $$. We perform a probabilistic analysis for both algorithms, deriving bounds on the expected value as well as failure probabilities for the approximation error when using Gaussian random DRMs. Both, the theoretical results and numerical experiments, show that the use of constant DRMs does not impair their effectiveness; our methods reliably return quasi‐best low‐rank approximations. [ABSTRACT FROM AUTHOR]

Directional interpolation is a fast and efficient compression technique for high‐frequency Helmholtz boundary integral equations, but requires a very large amount of storage in its original form. Algebraic recompression can significantly reduce the storage requirements and speed up the solution process accordingly. During the recompression process, weight matrices are required to correctly measure the influence of different basis vectors on the final result, and for highly accurate approximations, these weight matrices require more storage than the final compressed matrix. We present a compression method for the weight matrices and demonstrate that it introduces only a controllable error to the overall approximation. Numerical experiments show that the new method leads to a significant reduction in storage requirements. [ABSTRACT FROM AUTHOR]

As a commonly used nonparametric model to overcome the curse of dimensionality, the additive model continually attracts attentions of researchers. Our recent work (He et al., 2022) proposed to reduce the number of unknown functions to be estimated through learning an adaptive subspace shared by the additive component functions. Equipped with an efficient algorithm, our proposed reduced additive model outperforms the state‐of‐the‐art alternatives in numerical studies. However, the asymptotic properties of the proposed estimators have not been explored and the empirical findings are short of theoretical explanation. In this work, we fill in the theoretical gap by showing the resulting estimator has faster convergence rate than the estimation without subspace learning; and this is true even when the reduced additive model is only an approximation, provided that the subspace approximation error is small. Moreover, the proposed method is able to consistently identify the relevant predictors. The developed theoretical results back up the earlier empirical findings. [ABSTRACT FROM AUTHOR]