Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal parameters identification and sensitivity study for Abrasive Waterjet Milling model
85
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
In this paper we present the work related to the parameters identification for Abrasive Waterjet Milling (AWJM) model that appears as an ill-posed inverse problem. The necessity of studying this problem comes from the industrial milling applications where the possibility to predict and model the final surface with high accuracy is one of the primary tasks in the absence of any knowledge of the model parameters that should be used. The adjoint approach based on corresponding Lagrangian gives the opportunity to find out the unknowns of the AWJM model and their optimal values that could be used to reproduce the required trench profile. Due to the complexity of the nonlinear problem and the large number of the model parameters, we use an automatic differentiation (AD) software tool. This approach also gives us the ability to distribute the research on more complex cases and consider different types of model errors and 3D time dependent model with variations of the jet feed speed. This approach gives us a good opportunity to identify the optimal model parameters and predict the surface profile both with self-generated data and measurements obtained from the real production. Considering different types of model errors allows us to receive the results acceptable in manufacturing and to expect the proper identification of unknowns.
rate research
Read More
This paper discusses the properties of certain risk estimators recently proposed to choose regularization parameters in ill-posed problems. A simple approach is Steins unbiased risk estimator (SURE), which estimates the risk in the data space, while a recent modification (GSURE) estimates the risk in the space of the unknown variable. It seems intuitive that the latter is more appropriate for ill-posed problems, since the properties in the data space do not tell much about the quality of the reconstruction. We provide theoretical studies of both estimators for linear Tikhonov regularization in a finite dimensional setting and estimate the quality of the risk estimators, which also leads to asymptotic convergence results as the dimension of the problem tends to infinity. Unlike previous papers, who studied image processing problems with a very low degree of ill-posedness, we are interested in the behavior of the risk estimators for increasing ill-posedness. Interestingly, our theoretical results indicate that the quality of the GSURE risk can deteriorate asymptotically for ill-posed problems, which is confirmed by a detailed numerical study. The latter shows that in many cases the GSURE estimator leads to extremely small regularization parameters, which obviously cannot stabilize the reconstruction. Similar but less severe issues with respect to robustness also appear for the SURE estimator, which in comparison to the rather conservative discrepancy principle leads to the conclusion that regularization parameter choice based on unbiased risk estimation is not a reliable procedure for ill-posed problems. A similar numerical study for sparsity regularization demonstrates that the same issue appears in nonlinear variational regularization approaches.
We analyze the asymptotic behavior of a partial differential equation (PDE) model for hematopoiesis. This PDE model is derived from the original agent-based model formulated by (Roeder et al., Nat. Med., 2006), and it describes the progression of blood cell development from the stem cell to the terminally differentiated state. To conduct our analysis, we start with the PDE model of (Kim et al, JTB, 2007), which coincides very well with the simulation results obtained by Roeder et al. We simplify the PDE model to make it amenable to analysis and justify our approximations using numerical simulations. An analysis of the simplified PDE model proves to exhibit very similar properties to those of the original agent-based model, even if for slightly different parameters. Hence, the simplified model is of value in understanding the dynamics of hematopoiesis and of chronic myelogenous leukemia, and it presents the advantage of having fewer parameters, which makes comparison with both experimental data and alternative models much easier.
This paper extends the model reduction method by the operator projection to the one-dimensional special relativistic Boltzmann equation. The derivation of arbitrary order globally hyperbolic moment system is built on our careful study of two families of the complicate Grad type orthogonal polynomials depending on a parameter. We derive their recurrence relations, calculate their derivatives with respect to the independent variable and parameter respectively, and study their zeros and coefficient matrices in the recurrence formulas. Some properties of the moment system are also proved. They include the eigenvalues and their bound as well as eigenvectors,hyperbolicity, characteristic fields, linear stability, and Lorentz covariance. A semi-implicit numerical scheme is presented to solve a Cauchy problem of our hyperbolic moment system in order to verify the convergence behavior of the moment method. The results show that the solutions of our hyperbolic moment system can converge to the solution of the special relativistic Boltzmann equation as the order of the hyperbolic moment system increases.
This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the signal space on which the tools of differential (Riemannian) geometry can be applied. The main contribution of this paper is twofold. First, we prove that if a discrete dictionary reaches a minimal density criterion, then the corresponding discrete MP (dMP) is equivalent in terms of convergence to a weakened hypothetical continuous MP. Interestingly, the corresponding weakness factor depends on a density measure of the discrete dictionary. Second, we show that the insertion of a simple geometric gradient ascent optimization on the atom dMP selection maintains the previous comparison but with a weakness factor at least two times closer to unity than without optimization. Finally, we present numerical experiments confirming our theoretical predictions for decomposition of signals and images on regular discretizations of dictionary parametrizations.
This article deals with the uniqueness in identifying multiple parameters simultaneously in the one-dimensional time-fractional diffusion-wave equation of fractional time-derivative order $in (0,2)$ with the zero Robin boundary condition. Using the Laplace transform and a transformation formula, we prove the uniqueness in determining an order of the fractional derivative, a spatially varying potential, initial values and Robin coefficients simultaneously by boundary measurement data, provided that all the eigenmodes of an initial value do not vanish. Furthermore, for another formulation of inverse problem with input source term in place of initial value, by the uniqueness in the case of non-zero initial value and a Duhamel principle, we prove the simultaneous uniqueness in determining multiple parameters for a time-fractional diffusion-wave equation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
