6 resultados para approximate

em Deakin Research Online - Australia


Relevância:

20.00% 20.00%

Publicador:

Resumo:

An approximate numerical technique for modeling optical pulse propagation through weakly scattering biological tissue is developed by solving the photon transport equation in biological tissue that includes varying refractive index and varying scattering/absorption coefficients. The proposed technique involves first tracing the ray paths defined by the refractive index profile of the medium by solving the eikonal equation using a Runge-Kutta integration algorithm. The photon transport equation is solved only along these ray paths, minimizing the overall computational burden of the resulting algorithm. The main advantage of the current algorithm is that it enables to discretise the pulse propagation space adaptively by taking optical depth into account. Therefore, computational efficiency can be increased without compromising the accuracy of the algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Approximate models are often used for the following purposes: in on-line control systems of metal forming processes where calculation speed is critical; to obtain quick, quantitative information on the magnitude of the main variables in the early stages of process design; to illustrate the role of the major variables in the process; as an initial check on numerical modelling; and as a basis for quick calculations on processes in teaching and training packages. The models often share many similarities; for example, an arbitrary geometric assumption of deformation giving a simplified strain distribution, simple material property descriptions - such as an elastic, perfectly plastic law - and mathematical short cuts such as a linear approximation of a polynomial expression. In many cases, the output differs significantly from experiment and performance or efficiency factors are developed by experience to tune the models. In recent years, analytical models have been widely used at Deakin University in the design of experiments and equipment and as a pre-cursor to more detailed numerical analyses. Examples that are reviewed in this paper include deformation of sandwich material having a weak, elastic core, load prediction in deep drawing, bending of strip (particularly of ageing steel where kinking may occur), process analysis of low-pressure hydroforming of tubing, analysis of the rejection rates in stamping, and the determination of constitutive models by an inverse method applied to bending tests.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

To make the results reasonable, existing joint diagonalization algorithms have imposed a variety of constraints on diagonalizers. Actually, those constraints can be imposed uniformly by minimizing the condition number of diagonalizers. Motivated by this, the approximate joint diagonalization problem is reviewed as a multiobjective optimization problem for the first time. Based on this, a new algorithm for nonorthogonal joint diagonalization is developed. The new algorithm yields diagonalizers which not only minimize the diagonalization error but also have as small condition numbers as possible. Meanwhile, degenerate solutions are avoided strictly. Besides, the new algorithm imposes few restrictions on the target set of matrices to be diagonalized, which makes it widely applicable. Primary results on convergence are presented and we also show that, for exactly jointly diagonalizable sets, no local minima exist and the solutions are unique under mild conditions. Extensive numerical simulations illustrate the performance of the algorithm and provide comparison with other leading diagonalization methods. The practical use of our algorithm is shown for blind source separation (BSS) problems, especially when ill-conditioned mixing matrices are involved.