Search NASA⌕ Search

SEARCH · Search NASA

Results for “Convergence”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Optimality of Gradient-MUSIC for Spectral Estimation

We introduce the Gradient-MUSIC algorithm for estimating the unknown frequencies and amplitudes of a nonharmonic signal from noisy time samples. While the classical MUSIC algorithm performs a computationally expensive search over a fine grid, Gradient-MUSIC is significantly more efficient and eliminates the need for discretization over a fine grid by using optimization techniques. It coarsely scans the 1D landscape to find initialization simultaneously for all frequencies followed by parallelizable local refinement via gradient descent. We also analyze its performance when the noise level is sufficiently small and the signal frequencies are separated by at least 8π/m, where π/m is the standard resolution of this problem. Even though the 1D landscape is nonconvex, we prove a global convergence result for Gradient-MUSIC: coarse scanning provably finds suitable initialization and gradient descent converges at a linear rate. In addition to convergence results, we also upper bound the error between the true signal frequencies and amplitudes with those found by Gradient-MUSIC. For example, if the noise has $\ell^\infty$ norm at most ϵ, then the frequencies and amplitudes are recovered up to error at most Cϵ/m and Cϵ respectively, which are minimax optimal in m and ϵ. Our theory can also handle stochastic noise with performance guarantees under nonstationary independent Gaussian noise. Our main approach is a comprehensive geometric analysis of the landscape, a perspective that has not been explored before.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Dependence of wind-farm-induced gravity waves and wind farm performance on non-dimensional atmospheric parameters and simulation configuration

This large-eddy simulation (LES) study examines how wind-farm-induced atmospheric gravity waves (AGWs) and wind farm performance depend on non-dimensional atmospheric parameters and simulation configuration. A hypothetical aligned wind farm of actuator disks is simulated under neutral surface conditions, with a stable capping inversion and a mildly stable free atmosphere, to assess the effects of stratification beyond the atmospheric boundary layer (ABL) on ABL flow. Simulation set-ups fully resolving AGWs are validated to minimize spurious wave generation and reflection from the domain boundaries. The validated set-up is then used to analyze AGW types and characteristics, as well as stratification impacts under conventionally neutral boundary layer (CNBL) conditions. These conditions are governed by four non-dimensional parameters: the Froude numbers of the free atmosphere and capping inversion (Fr, Fr i ), and the aspect ratios of the ABL and wind farm (H̃ i , S h ). Simulation configurations that fully resolve AGWs – capturing at least one wavelength both horizontally and vertically – yield the most realistic stratification effects on ABL flow, whereas partial or unresolved configurations produce non-physical, channel-like behavior. A coherent description of the AGW phenomena is provided, highlighting the central role of capping inversion displacement in linking ABL fluctuations with AGWs. Trapped waves are confined within the capping inversion, while interfacial and internal waves aloft are identified as the AGW types most relevant to wind farm performance. The wavy inversion, analogous to an interfacial wave, forms converging and diverging zones that drive power fluctuations across the farm. The interfacial wavelength, measured over the wind farm, corresponds to one diverging, one converging, and one mildly diverging zone. As the interfacial wavelength decreases with Fr i , multiple convergence–divergence zones develop under sub-critical conditions (Fr i <1.0), while for super-critical conditions (Fr i > 1.0), the wavelength approaches the farm length. Wave amplitude increases with decreasing H̃ i (i.e., shallower capping inversions). Wind farm performance is most sensitive to H̃ i : shallow boundary layers increase blockage and reduce efficiency, while deeper layers enhance efficiency. Increasing Fr and Fr i mitigates blockage, and increasing S h mainly improves wake recovery. Although local power fluctuations arise from AGWs, overall wind farm efficiency remains nearly constant with Fr and Fr i , improving primarily with larger H̃ i and S h .

17 WIND ENERGY↗
DOE OSTI2024

On the Representativity of Electrode Microstructure Parameters and Their Electrochemical Response for Lithium Ion Batteries

Lithium-ion battery electrochemical models require an accurate description of the electrodes microstructures to be predictive that can be achieved through nanoscale imaging. Such observations are however limited by their field of view (FOV), as they provide only a subset of the whole electrode volume that does not necessarily represent the whole electrode microstructure heterogeneity, and therefore can bias the microstructure analysis. A microstructure scale electrochemical model was used to investigate lithium plating onset, material non-uniform utilization, and in-plane heterogeneities for an NMC-graphite full cell. To evaluate the representativeness, and thus relevance, of these model predictions, a coupled representativity analysis has been performed on the microstructure parameters and, in a novel way, on the full cell electrochemical response. Electrode microstructure parameters representativeness has been first quantified using the representative volume element (RVE) methodology. The RVE major flaw is that ultimately it can only conclude if a FOV contains representative subvolumes of the FOV, but not if the FOV itself is representative of the electrode volume. Analysis can conclude negatively ('FOV is not representative'), but not positively ('FOV is representative'). One major contribution of this work was to quantify the convergence of the RVE size with the FOV, to actually investigate the FOV representativeness and thus partly remedy this intrinsic limitation. The analysis determined that performing a standard RVE calculation, without exploring its FOV convergence, is likely to strongly underestimate the actual RVE size. The new RVE methodology has been automated in the NREL open-source Microstructure Analysis Toolbox (MATBOX) and is available to the battery community. Representativeness of microstructure parameters is however only an intermediate step, as the end-results of an electrochemical model are performances predictions. Indeed, what is the practical consequence of a given deviation for a microstructure parameter? The microstructure parameter deviation propagations to the 3D microstructure scale electrochemical response have been then quantified for different charge rates. This defines a threshold for the microstructure parameters FOV for a desired maximum deviation of the electrochemical response. Such deviation propagation analysis is analogous to error propagation analysis and is necessary to determine the relevance of microstructure scale model predictions for macroscale predictions. Electrochemical model shows cell representative section areas are increasing with C-rate, due to higher in-plane heterogeneities, indicating larger FOVs are required specifically for fast charge modeling. Therefore, we introduced the novel concept of electrochemical RVE (eRVE) that is a function of the operating conditions (thus defined as a dynamic RVE), with an increasing dependence with the C-rate. Representativity analysis of the investigated cell determined a FOV of 144.4 x 54.4 m2 is large enough to establish a convergence on the representative section areas for low to intermediate C-rate (=2.5C), but not large enough to conclude for higher rates. This work aims to emphasize the importance of representativity analysis for LIB electrode microstructures, as it is required to estimate the error, and thus the relevance, of microstructure parameters intended to be used in macroscale models. The methodology and results can help researchers to select the relevant imaging and associated FOV required to provide accurate enough microstructure parameters.

ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

FedOSAA: Improving Federated Learning with One-Step Anderson Acceleration

Federated learning (FL) is a distributed machine learning approach that enables multiple local clients and a central server to collaboratively train a model while keeping the data on their own devices. First-order methods, particularly those incorporating variance reduction techniques, are the most widely used FL algorithms due to their simple implementation and stable performance. However, these methods tend to be slow and require a large number of communication rounds to reach the global minimizer. We propose FedOSAA, a novel approach that preserves the simplicity of first-order methods while achieving the rapid convergence typically associated with second-order methods. Our approach applies one Anderson acceleration (AA) step following classical local updates based on first-order methods with variance reduction, such as FedSVRG and SCAFFOLD, during local training. This AA step is able to leverage curvature information from the history points and gives a new update that approximates the Newton-GMRES direction, thereby significantly improving the convergence. We establish a local linear convergence rate to the global minimizer of FedOSAA for smooth and strongly convex loss functions. Numerical comparisons show that FedOSAA substantially improves the communication and computation efficiency of the original first-order methods, achieving performance comparable to second-order methods like GIANT.

Feng, Xue [University of California, Davis]↗
DOE OSTI2025

Robust Implicit Adaptive Low Rank Time-Stepping Methods for Matrix Differential Equations

In this work, we develop implicit rank-adaptive schemes for time-dependent matrix differential equations. The dynamic low rank approximation (DLRA) is a well-known technique to capture the dynamic low rank structure based on Dirac–Frenkel time-dependent variational principle. In recent years, it has attracted a lot of attention due to its wide applicability. Our schemes are inspired by the three-step procedure used in the rank adaptive version of the unconventional robust integrator (the so called BUG integrator) (Ceruti et al. in BIT Numer Math 62(4):1149–1174, 2022) for DLRA. First, a prediction (basis update) step is made computing the approximate column and row spaces at the next time level. Second, a Galerkin evolution step is invoked using an implicit solves for the small core matrix. Finally, a truncation is made according to a prescribed error threshold. Since the DLRA is evolving the differential equation projected on to the tangent space of the low rank manifold, the error estimate of the BUG integrator contains the tangent projection (modeling) error which cannot be easily controlled by mesh refinement. This can cause convergence issue for equations with cross terms. To address this issue, we propose a simple modification, consisting of merging the row and column spaces from the explicit step truncation method together with the BUG spaces in the prediction step. In addition, we propose an adaptive strategy where the BUG spaces are only computed if the residual for the solution obtained from the prediction space by explicit step truncation method, is too large. Here, we prove stability and estimate the local truncation error of the schemes under assumptions. We benchmark the schemes in several tests, such as anisotropic diffusion, solid body rotation and the combination of the two, to show robust convergence properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Integrating Intermediate Traits in Phylogenetic Genotype-to-Phenotype Studies

A major goal of research in evolution and genetics is linking genotype to phenotype. This work could be direct, such as determining the genetic basis of a phenotype by leveraging genetic variation or divergence in a developmental, physiological, or behavioral trait. The work could also involve studying the evolutionary phenomena (e.g., reproductive isolation, adaptation, sexual dimorphism, behavior) that reveal an indirect link between genotype and a trait of interest. When the phenotype diverges across evolutionarily distinct lineages, this genotype-to-phenotype problem can be addressed using phylogenetic genotype-to-phenotype (PhyloG2P) mapping, which uses genetic signatures and convergent phenotypes on a phylogeny to infer the genetic bases of traits. The PhyloG2P approach has proven powerful in revealing key genetic changes associated with diverse traits, including the mammalian transition to marine environments and transitions between major mechanisms of photosynthesis. However, there are several intermediate traits layered in between genotype and the phenotype of interest, including but not limited to transcriptional profiles, chromatin states, protein abundances, structures, modifications, metabolites, and physiological parameters. Each intermediate trait is interesting and informative in its own right, but synthesis across data types has great promise for providing a deep, integrated, and predictive understanding of how genotypes drive phenotypic differences and convergence. We argue that an expanded PhyloG2P framework (the PhyloG2P matrix) that explicitly considers intermediate traits, and imputes those that are prohibitive to obtain, will allow a better mechanistic understanding of any trait of interest. Furthermore, this approach provides a proxy for functional validation and mechanistic understanding in organisms where laboratory manipulation is impractical.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

Semiglobal Safety-Filtered Extremum Seeking With Unknown CBFs

We introduce a safe extremum-seeking (Safe ES) algorithm which achieves the minimization of an unknown objective function while ensuring that an unknown, yet measured, control barrier function (CBF) remains above an arbitrarily small negative value for all time. In other words, “practical safety” is maintained during the entire period of convergence to the constrained extremum. Our design is based on quadratic program (QP) CBF style filters for safety, which is applied in an average and estimated sense. Using nonsmooth analysis tools, we guarantee semiglobal practical asymptotic (SPA) stability of the global constrained optimum, practical convergence to the safe set if starting in a condition violating the CBF, and practical safety for all time—semiglobally—if starting in safe set. The safety result of the paper is analogous with modern notions of SPA stability, guaranteeing that, for any small violation of safety, there exist design coefficients which guarantee that such a small violation is not exceeded. The paper outlines a set of sufficient conditions on the barrier and objective functions, and by way of a Lyapunov argument, we demonstrate that nonconvex constrained optimization problems can be solved. We present these results in the setting of a static map and a dynamical system. A simulation example illustrates the results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Nonlinear optimal recovery in Hilbert spaces

Here, this paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear optimal recovery problem, establishing its well-posedness and proving its convergence to the true solution as the number of measurements increases. However, the resulting formulation might not have a finite-dimensional solution in general. We thus present a sufficient condition for the finite dimensionality of the solution, applicable to problems with well-defined point evaluation measurements. To address the broader setting, we introduce a relaxed nonlinear optimal recovery and provide a detailed convergence analysis. An illustrative example is given to demonstrate that our formulations and theoretical findings offer a comprehensive framework for solving nonlinear problems in infinite-dimensional spaces with limited data.

convergence↗
DOE OSTI2025

Hydrogen Bond Benchmark: Focal‐Point Analysis and Assessment of DFT Functionals

We performed a hierarchical, convergent ab initio benchmark study and systematically analyzed the performance of density functional approximations for describing hydrogen bonds in small neutral, cationic, and anionic complexes, as well as in larger systems involving amide, urea, deltamide, and squaramide moieties. Focal point analyses (FPA), extrapolating to the ab initio limit, were carried out using correlated wave function methods up to CCSDT(Q) for the small complexes and CCSD(T) for the larger systems, together with correlation-consistent Gaussian basis sets up to the complete basis set limit. Optimized geometries and vibrational frequencies were obtained at the CCSD(T) level. The resulting FPA hydrogen-bond energies converge within a few tenths of a kcal mol −1 . These reference data were used to evaluate 60 density functionals (including 12 dispersion-corrected), spanning the local-density approximation (LDA), generalized gradient approximations (GGAs), meta-GGAs, hybrids, meta-hybrids, double-hybrids, and range-separated hybrids. Overall, the meta-hybrid M06-2X provides the best performance for both hydrogen bond energies and geometries, while the dispersion-corrected GGAs BLYP-D3(BJ) and BLYP-D4 also yield accurate hydrogen-bond data and can serve as cost-effective options for studying large and complex systems.

coupled cluster theory↗
DOE OSTI2024

Anderson acceleration with approximate calculations: Applications to scientific computing

Here we provide rigorous theoretical bounds for Anderson acceleration (AA) that allow for approximate calculations when applied to solve linear problems. We show that, when the approximate calculations satisfy the provided error bounds, the convergence of AA is maintained while the computational time could be reduced. We also provide computable heuristic quantities, guided by the theoretical error bounds, which can be used to automate the tuning of accuracy while performing approximate calculations. For linear problems, the use of heuristics to monitor the error introduced by approximate calculations, combined with the check on monotonicity of the residual, ensures the convergence of the numerical scheme within a prescribed residual tolerance. Motivated by the theoretical studies, we propose a reduced variant of AA, which consists in projecting the least-squares used to compute the Anderson mixing onto a subspace of reduced dimension. The dimensionality of this subspace adapts dynamically at each iteration as prescribed by the computable heuristic quantities. We numerically show and assess the performance of AA with approximate calculations on: (i) linear deterministic fixed-point iterations arising from the Richardson's scheme to solve linear systems with open-source benchmark matrices with various preconditioners and (ii) non-linear deterministic fixed-point iterations arising from non-linear time-dependent Boltzmann equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Solving a class of infinite-dimensional tensor eigenvalue problems by translational invariant tensor ring approximations

Here, we examine a method for solving an infinite-dimensional tensor eigenvalue problem Hx = λx, where the infinite-dimensional symmetric matrix H exhibits a translational invariant structure. We provide a formulation of this type of problem from a numerical linear algebra point of view and describe how a power method applied to e -Ht is used to obtain an approximation to the desired eigenvector. This infinite-dimensional eigenvector is represented in a compact way by a translational invariant infinite Tensor Ring (iTR). Low rank approximation is used to keep the cost of subsequent power iterations bounded while preserving the iTR structure of the approximate eigenvector. We show how the averaged Rayleigh quotient of an iTR eigenvector approximation can be efficiently computed and introduce a projected residual to monitor its convergence. In the numerical examples, we illustrate that the norm of this projected iTR residual can also be used to automatically modify the time step to ensure accurate and rapid convergence of the power method.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enhancing the cooling performance of thermocouples: a power-constrained topology optimization procedure

Abstract Heat pumping through thermoelectric devices has many advantages over traditional cooling. However, their current efficiency is a limiting factor in their implementation. In this paper, we approach the non-convex topology optimization of thermoelectrical elements for cooling applications through the method of moving asymptotes (MMA) to improve their cooling capabilities per watt usage. The optimization problem is defined for a given power budget, aiming for the minimum temperature with a known heat pumping need. The introduction of power as a constraint justifies the introduction of the voltage gradient across the thermocouple as a design variable to maintain the thermoelectrical device in its optimum power-to-heat extraction ratio. To better understand the convergence of this non-convex problem, we present a two-variable analytical thermoelectric optimization model. This example provides information on how to select the penalty parameters used to scale the three material coefficients involved in the problem to obtain lower objective values and better convergence using MMA. The analytical model shows the non-convexity of the problem and provides the recommendation to use penalization coefficients of the form $$p_k=p_{\sigma }>p_{\alpha }=1$$ p k = p σ > p α = 1 for the thermal conductivity, electrical conductivity, and Seebeck coefficients. We tested these penalization coefficients through optimizations of a model based on the 1MC10-031 commercial thermoelectric-cooler (TEC) using the finite element method (FEM). These penalization coefficients provided local minima without the need for volume constraints. With this procedure, we found designs that provided temperatures close to 10 degrees lower using 60% less semiconductor material volume compared to the initial design.

Gutiérrez, G. Reales↗
DOE OSTI2026

On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials

Efficient simulation of many-body quantum systems is central to advances in physics, chemistry, and quantum computing, with a key question being whether the simulation cost scales polynomially with the system size. Here, in this work, we analyze many-body quantum systems with Coulomb interactions, which are fundamental to electronic and molecular systems. We prove that Trotterization for such unbounded Hamiltonians achieves a 1/4-order convergence rate, with explicit polynomial dependence on the number of particles. The result holds for all initial wavefunctions in the domain of the Hamiltonian, and the 1/4-order convergence rate is optimal, as previous work has numerically demonstrated that it can be saturated by a specific initial ground state. The main challenges arise from the many-body structure and the singular nature of the Coulomb potential. Our proof strategy differs from prior state-of-the-art Trotter analyses, addressing both difficulties in a unified framework. Our analysis treats the Coulomb potential as an unbounded operator without modification or regularization, and does not rely on spatial discretization, making it compatible with both first- and second-quantized circuit constructions.

Fang, Di [Duke Univ., Durham, NC (United States)]↗
DOE OSTI2024

Image-based modeling of coupled electro-chemo-mechanical behavior of Li-ion battery cathode using an interface-modified reproducing kernel particle method

Abstract An interface-modified reproducing kernel particle method (IM-RKPM) is introduced in this work to allow for a direct model construction from image pixels of heterogeneous polycrystalline Li-ion battery microstructures. The interface-modified reproducing kernel (IM-RK) approximation is constructed through scaling of a kernel function by a regularized distance function in conjunction with strategic placement of interface node locations. This leads to RK shape functions with either weak or strong discontinuities across material interfaces, suitable for modeling various interface mechanics. With the placement of a triple junction node and distance-based scaling of kernel functions, the resulting IM-RK shape function also possesses proper discontinuities at the triple junctions. This IM-RK approximation effectively remedies the well-known Gibb’s oscillation in the smooth approximation of discontinuities. Different from the conventional meshfree approaches for interface discontinuities, this IM-RK approach is done without additional degrees of freedom associated with the enrichment functions, and it is formulated with the standard procedures in the RK shape function construction. This work focuses on identifying the accuracy and convergence properties of IM-RKPM for modeling the coupled electro-chemo-mechanical system. A linear patch test is formulated and numerically tested for the electro-chemo-mechanical coupled problem with a Butler–Volmer boundary condition representing the physical conditions in Li-ion battery microstructures. This is followed by verification of the optimal rates of convergence of IM-RKPM for solving the coupled problem with higher order solutions. The image-based modeling of Li-ion battery microstructures in the numerical examples demonstrates the applicability of the proposed method to realistic Li-ion battery materials modeling.

25 ENERGY STORAGE↗
DOE OSTI2024

Numerical analysis of a time discretized method for nonlinear filtering problem with Lévy process observations

Abstract In this paper, we consider a nonlinear filtering model with observations driven by correlated Wiener processes and point processes. We first derive a Zakai equation whose solution is an unnormalized probability density function of the filter solution. Then, we apply a splitting-up technique to decompose the Zakai equation into three stochastic differential equations, based on which we construct a splitting-up approximate solution and prove its half-order convergence. Furthermore, we apply a finite difference method to construct a time semi-discrete approximate solution to the splitting-up system and prove its half-order convergence to the exact solution of the Zakai equation. Finally, we present some numerical experiments to demonstrate the theoretical analysis.

Mathematics↗
DOE OSTI2026

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An Empirical Quantile Estimation Approach for Chance-Constrained Nonlinear Optimization Problems

We investigate an empirical quantile estimation approach to solve chance-constrained nonlinear optimization problems. Our approach is based on the reformulation of the chance constraint as an equivalent quantile constraint to provide stronger signals on the gradient. In this approach, the value of the quantile function is estimated empirically from samples drawn from the random parameters, and the gradient of the quantile function is estimated via a finite-difference approximation on top of the quantile-function-value estimation. We establish a convergence theory of this approach within the framework of an augmented Lagrangian method for solving general nonlinear constrained optimization problems. The foundation of the convergence analysis is a concentration property of the empirical quantile process, and the analysis is divided based on whether or not the quantile function is differentiable. In contrast to the sampling-and-smoothing approach used in the literature, the method developed in this paper does not involve any smoothing function and hence the quantile-function gradient approximation is easier to implement and there are less accuracy-control parameters to tune. Furthermore, we demonstrate the effectiveness of this approach and compare it with a smoothing method for the quantile-gradient estimation. Numerical investigation shows that the two approaches are competitive for certain problem instances.

Applied Probability↗
DOE OSTI2024

Minimum entropy filtering for a single output non-Gaussian stochastic system using state transformation

This paper presents a novel filter design for the single-output stochastic non-linear systems subjected to non-Gaussian noises and the proposed assumptions. Based on a state transformation, the unmeasurable states of the systems can be estimated where non-linear terms in the systems have been eliminated. It has been shown that the estimation error is linearly dynamical regarding to the presented vector-valued filter gain which can be optimised by minimising the entropy-based performance criterion. In addition, the convergence of the presented algorithm is analysed in mean-square sense and a numerical example is given to verify the effectiveness of the presented filtering algorithm. Meanwhile, the extended Kalman filter, unscented particle filter and minimum entropy filter are given for the comparisons of the filtering performance. Following the presented framework, some extensions of the presented filtering algorithm are discussed to indicate the flexibility of the filter design. The contribution of this paper can be summarised as establishing a novel minimum entropy filtering framework which consists of model transformation, entropy optimisation and convergence analysis.

42 ENGINEERING↗