Search results for "MathematicsofComputing_NUMERICALANALYSIS"
showing 10 items of 149 documents
A Computationally Inexpensive Approach in Multiobjective Heat Exchanger Network Synthesis
2010
We consider a heat exchanger network synthesis problem formulated as a multiobjective optimization problem. The Pareto front of this problem is approximated with a new approximation approach and the preferred point on the approximation is found with the interactive multiobjective optimization method NIMBUS. Using the approximation makes the solution process computationally inexpensive. Finally, the preferred outcome on the Pareto front approximation is projected on the actual Pareto front. peerReviewed
On optimal control of free boundary problems of obstacle type
2018
A numerical study of an optimal control formulation for a shape optimization problem governed by an elliptic variational inequality is performed. The shape optimization problem is reformulated as a boundary control problem in a fixed domain. The discretized optimal control problem is a non-smooth and non-convex mathematical programing problem. The performance of the standard BFGS quasi-Newton method and the BFGS method with the inexact line search are tested.
Walsh function analysis of 2-D generalized continuous systems
1990
The importance of the generalized or singular 2D continuous systems are demonstrated by showing their use in the solution of partial differential equations in two variables. A technique is presented for solving these systems in terms of Walsh functions. The method replaces the solution of a two-variable partial differential equation with the solution of a linear algebraic generalized 2D Sylvester equation. An efficient technique for the recursive solution of the latter equation is offered. All the results apply also in the usual Roesser 2D state-space case. >
"Table 1" of "Backward electroproduction of pi0 mesons on protons in the region of nucleon resonances at four momentum transfer squared Q**2 = 1.0-Ge…
2005
Cross section SIG(T) + EPSILON*SIG(L) for COS(THETA*) = -0.975.
"Table 2" of "Backward electroproduction of pi0 mesons on protons in the region of nucleon resonances at four momentum transfer squared Q**2 = 1.0-Ge…
2005
Cross section SIG(T) + EPSILON*SIG(L) for COS(THETA*) = -0.925.
"Table 4" of "Backward electroproduction of pi0 mesons on protons in the region of nucleon resonances at four momentum transfer squared Q**2 = 1.0-Ge…
2005
Cross section SIG(T) + EPSILON*SIG(L) for COS(THETA*) = -0.825.
"Table 3" of "Backward electroproduction of pi0 mesons on protons in the region of nucleon resonances at four momentum transfer squared Q**2 = 1.0-Ge…
2005
Cross section SIG(T) + EPSILON*SIG(L) for COS(THETA*) = -0.875.
Shrinkage and spectral filtering of correlation matrices: A comparison via the Kullback-Leibler distance
2007
The problem of filtering information from large correlation matrices is of great importance in many applications. We have recently proposed the use of the Kullback-Leibler distance to measure the performance of filtering algorithms in recovering the underlying correlation matrix when the variables are described by a multivariate Gaussian distribution. Here we use the Kullback-Leibler distance to investigate the performance of filtering methods based on Random Matrix Theory and on the shrinkage technique. We also present some results on the application of the Kullback-Leibler distance to multivariate data which are non Gaussian distributed.
Spline Histogram Method for Reconstruction of Probability Density Functions of Clusters of Galaxies
2003
We describe the spline histogram algorithm which is useful for visualization of the probability density function setting up a statistical hypothesis for a test. The spline histogram is constructed from discrete data measurements using tensioned cubic spline interpolation of the cumulative distribution function which is then differentiated and smoothed using the Savitzky-Golay filter. The optimal width of the filter is determined by minimization of the Integrated Square Error function. The current distribution of the TCSplin algorithm written in f77 with IDL and Gnuplot visualization scripts is available from this http URL
Polynomial approximation of non-Gaussian unitaries by counting one photon at a time
2017
In quantum computation with continous-variable systems, quantum advantage can only be achieved if some non-Gaussian resource is available. Yet, non-Gaussian unitary evolutions and measurements suited for computation are challenging to realize in the lab. We propose and analyze two methods to apply a polynomial approximation of any unitary operator diagonal in the amplitude quadrature representation, including non-Gaussian operators, to an unknown input state. Our protocols use as a primary non-Gaussian resource a single-photon counter. We use the fidelity of the transformation with the target one on Fock and coherent states to assess the quality of the approximate gate.