Relevant bibliographies by topics / Gauss-newton search

Academic literature on the topic 'Gauss-newton search'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Gauss-newton search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Gauss-newton search"

1

Chen, Ke, and Mauricio D. Sacchi. "Time-domain elastic Gauss–Newton full-waveform inversion: a matrix-free approach." Geophysical Journal International 223, no. 2 (July 21, 2020): 1007–39. http://dx.doi.org/10.1093/gji/ggaa330.

Full text
Abstract:
SUMMARY We present a time-domain matrix-free elastic Gauss–Newton full-waveform inversion (FWI) algorithm. Our algorithm consists of a Gauss–Newton update with a search direction calculated via elastic least-squares reverse time migration (LSRTM). The conjugate gradient least-squares (CGLS) method solves the LSRTM problem with forward and adjoint operators derived via the elastic Born approximation. The Hessian of the Gauss–Newton method is never explicitly formed or saved in memory. In other words, the CGLS algorithm solves for the Gauss–Newton direction via the application of implicit-form forward and adjoint operators which are equivalent to elastic Born modelling and elastic reverse time migration, respectively. We provide numerical examples to test the proposed algorithm where we invert for P- and S-wave velocities simultaneously. The proposed algorithm performs positively on mid-size problems where we report solutions of slight improvement than those computed using the conventional non-linear conjugate gradient method. In spite of the aforementioned limited gain, the theory developed in this paper contributes to a better understanding of time-domain elastic Gauss–Newton FWI.
APA, Harvard, Vancouver, ISO, and other styles
2

CHIANG, TIHAO, and YA-QIN ZHANG. "STEREOSCOPIC VIDEO CODING USING A FAST AND ROBUST AFFINE MOTION SEARCH." International Journal of Image and Graphics 01, no. 02 (April 2001): 231–50. http://dx.doi.org/10.1142/s0219467801000153.

Full text
Abstract:
This paper presents a stereoscopic video compression scheme using a novel fast affine motion estimation technique. A temporal scalable approach is used to achieve backward compatibility with a standard definition TV. We use an adaptive mode selection scheme from three temporal locations in both channels. Both block-based and affine-motion based approaches are used to achieve two levels of improvements with different complexities. An innovative motion estimation technique using Gauss–Newton optimization and pyramid processing is implemented to efficiently estimate affine parameters. Unlike other Gauss–Newton approaches, our search technique uses only addition, subtraction and multiplication and it converges within four iterations, which implies great complexity reduction. An efficient and robust affine motion prediction yields significant over the disparity-based approach. Part of the disparity-based approach has been tested in the rigorous MPEG-2 bitstream exchange process, and adopted in the MPEG-2 Multi-View Profile (MVP).
APA, Harvard, Vancouver, ISO, and other styles
3

de Klerk, E., J. Peng, C. Roos, and T. Terlaky. "A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization." SIAM Journal on Optimization 11, no. 4 (January 2001): 870–88. http://dx.doi.org/10.1137/s1052623499352632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

De Zaeytijd, Jürgen, and Ann Franchois. "A Subspace Preconditioned LSQR Gauss-Newton Method with a Constrained Line Search Path Applied to 3D Biomedical Microwave Imaging." International Journal of Antennas and Propagation 2015 (2015): 1–21. http://dx.doi.org/10.1155/2015/924067.

Full text
Abstract:
Three contributions that can improve the performance of a Newton-type iterative quantitative microwave imaging algorithm in a biomedical context are proposed. (i) To speed up the iterative forward problem solution, we extrapolate the initial guess of the field from a few field solutions corresponding to previous source positions for the same complex permittivity (i.e., “marching on in source position”) as well as from a Born-type approximation that is computed from a field solution corresponding to one previous complex permittivity profile for the same source position. (ii) The regularized Gauss-Newton update system can be ill-conditioned; hence we propose to employ a two-level preconditioned iterative solution method. We apply the subspace preconditioned LSQR algorithm from Jacobsen et al. (2003) and we employ a 3D cosine basis. (iii) We propose a new constrained line search path in the Gauss-Newton optimization, which incorporates in a smooth manner lower and upper bounds on the object permittivity, such that these bounds never can be violated along the search path. Single-frequency reconstructions from bipolarized synthetic data are shown for various three-dimensional numerical biological phantoms, including a realistic breast phantom from the University of Wisconsin-Madison (UWCEM) online repository.
APA, Harvard, Vancouver, ISO, and other styles
5

Acarnley, Paul. "Power System Load Flow Analysis Using an Excel Workbook." International Journal of Electrical Engineering & Education 42, no. 2 (April 2005): 185–202. http://dx.doi.org/10.7227/ijeee.42.2.6.

Full text
Abstract:
The paper describes the development and features of an MS-Excel Workbook (available at www.reseeds.com ), which illustrates four methods of power system load flow analysis. Iterative techniques are represented by the Newton-Raphson and Gauss-Seidel methods. The Workbook also includes two search algorithms: genetic algorithms and simulated annealing.
APA, Harvard, Vancouver, ISO, and other styles
6

BAKIR, PELIN GUNDES, and Y. SERHAT ERDOGAN. "DAMAGE IDENTIFICATION IN REINFORCED CONCRETE BEAMS BY FINITE ELEMENT MODEL UPDATING USING PARALLEL AND HYBRID GENETIC ALGORITHMS." International Journal of Computational Methods 10, no. 03 (April 17, 2013): 1350010. http://dx.doi.org/10.1142/s0219876213500102.

Full text
Abstract:
Finite element (FE) model updating belongs to the class of inverse problems in mechanics and is a constrained optimization problem. In FE model updating, the difference between the modal parameters (the frequencies, damping ratios and the mode shapes) obtained from the FE model of the structure and those from the vibration measurements are minimized within an optimization algorithm. The design variables of the optimization problem are the stiffness reduction factors, which represent the damage. In this study, the Genetic Algorithms (GA), the Parallel GA, the local search algorithms, the Trust Region Gauss Newton, the Sequential Quadratic Programming, the Levenberg–Marquardt Techniques and the hybrid versions of these methods are applied within the FE Model Updating Technique for updating the Young's modulus of different FEs of a reinforced concrete beam. Different damage scenarios and different noise levels are taken into account. The results of the study show that the local search algorithms cannot detect, locate and quantify damage in reinforced concrete beam type structures while the GA together with the hybrid and the parallel versions detect, localize and identify the damage very accurately. It is apparent that the hybrid GA & Trust Region Gauss Newton Technique is best in terms of the computation speed as well as accuracy.
APA, Harvard, Vancouver, ISO, and other styles
7

Lian, Zhigang, Songhua Wang, and Yangquan Chen. "A Velocity-Combined Local Best Particle Swarm Optimization Algorithm for Nonlinear Equations." Mathematical Problems in Engineering 2020 (August 25, 2020): 1–9. http://dx.doi.org/10.1155/2020/6284583.

Full text
Abstract:
Many people use traditional methods such as quasi-Newton method and Gauss–Newton-based BFGS to solve nonlinear equations. In this paper, we present an improved particle swarm optimization algorithm to solve nonlinear equations. The novel algorithm introduces the historical and local optimum information of particles to update a particle’s velocity. Five sets of typical nonlinear equations are employed to test the quality and reliability of the novel algorithm search comparing with the PSO algorithm. Numerical results show that the proposed method is effective for the given test problems. The new algorithm can be used as a new tool to solve nonlinear equations, continuous function optimization, etc., and the combinatorial optimization problem. The global convergence of the given method is established.
APA, Harvard, Vancouver, ISO, and other styles
8

Šeruga, Domen, and Marko Nagode. "Comparative analysis of optimisation methods for linking material parameters of exponential and power models: An application to cyclic stress–strain curves of ferritic stainless steel." Proceedings of the Institution of Mechanical Engineers, Part L: Journal of Materials: Design and Applications 233, no. 9 (August 13, 2018): 1802–13. http://dx.doi.org/10.1177/1464420718790829.

Full text
Abstract:
The four most commonly used optimisation methods for linking the material parameters of an exponential Armstrong–Frederick and a power Ramberg–Osgood model are compared for given cyclic stress–strain curves of a ferritic stainless steel EN 1.4512. These methods are the damped Gauss–Newton method, the Levenberg–Marquardt method, the Downhill Simplex method and a genetic algorithm. Globally optimal material parameters are obtained by parallel searches within the methods. The methods are tested for cyclic curves at 20 ℃, 300 ℃, 650 ℃ and 850 ℃. The optimal values of material parameters and R2 values are comparable, whereas the search paths, the numbers of steps to reach optimal solutions and the processing time of the methods differ.
APA, Harvard, Vancouver, ISO, and other styles
9

Wang, Jueyu, and Detong Zhu. "The Gauss-Newton Methods via Conjugate Gradient Path without Line Search Technique for Solving Nonlinear Systems." Numerical Functional Analysis and Optimization 38, no. 1 (September 14, 2016): 110–37. http://dx.doi.org/10.1080/01630563.2016.1232729.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lampariello, F., and M. Sciandrone. "Use of the Minimum-Norm Search Direction in a Nonmonotone Version of the Gauss-Newton Method." Journal of Optimization Theory and Applications 119, no. 1 (October 2003): 65–82. http://dx.doi.org/10.1023/b:jota.0000005041.99777.af.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Gauss-newton search"

1

Jacmenovic, Dennis, and dennis_jacman@yahoo com au. "Optimisation of Active Microstrip Patch Antennas." RMIT University. Electrical and Computer Engineering, 2004. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20060307.144507.

Full text
Abstract:
This thesis presents a study of impedance optimisation of active microstrip patch antennas to multiple frequency points. A single layered aperture coupled microstrip patch antenna has been optimised to match the source reflection coefficient of a transistor in designing an active antenna. The active aperture coupled microstrip patch antenna was optimised to satisfy Global Positioning System (GPS) frequency specifications. A rudimentary aperture coupled microstrip patch antenna consists of a rectangular antenna element etched on the top surface of two dielectric substrates. The substrates are separated by a ground plane and a microstrip feed is etched on the bottom surface. A rectangular aperture in the ground plane provides coupling between the feed and the antenna element. This type of antenna, which conveniently isolates any circuit at the feed from the antenna element, is suitable for integrated circuit design and is simple to fabricate. An active antenna design directly couples an antenna to an active device, therefore saving real estate and power. This thesis focuses on designing an aperture coupled patch antenna directly coupled to a low noise amplifier as part of the front end of a GPS receiver. In this work an in-house software package, dubbed ACP by its creator Dr Rod Waterhouse, for calculating aperture coupled microstrip patch antenna performance parameters was linked to HP-EEsof, a microwave computer aided design and simulation package by Hewlett-Packard. An ANSI C module in HP-EEsof was written to bind the two packages. This process affords the client the benefit of powerful analysis tools offered in HP-EEsof and the fast analysis of ACP for seamless system design. Moreover, the optimisation algorithms in HP-EEsof were employed to investigate which algorithms are best suited for optimising patch antennas. The active antenna design presented in this study evades an input matching network, which is accomplished by designing the antenna to represent the desired source termination of a transistor. It has been demonstrated that a dual-band microstrip patch antenna can be successfully designed to match the source reflection coefficient, avoiding the need to insert a matching network. Maximum power transfer in electrical circuits is accomplished by matching the impedance between entities, which is generally acheived with the use of a matching network. Passive matching networks employed in amplifier design generally consist of discrete components up to the low GHz frequency range or distributed elements at greater frequencies. The source termination for a low noise amplifier will greatly influence its noise, gain and linearity which is controlled by designing a suitable input matching network. Ten diverse search methods offered in HP-EEsof were used to optimise an active aperture coupled microstrip patch antenna. This study has shown that the algorithms based on the randomised search techniques and the Genetic algorithm provide the most robust performance. The optimisation results were used to design an active dual-band antenna.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Gauss-newton search"

1

Kumar, Yugal, and Gadadhar Sahoo. "Application of Charge System Search Algorithm for Data Clustering." In Handbook of Research on Emerging Perspectives in Intelligent Pattern Recognition, Analysis, and Image Processing, 383–99. IGI Global, 2016. http://dx.doi.org/10.4018/978-1-4666-8654-0.ch018.

Full text
Abstract:
This chapter presents a charged system search (CSS) optimization method for finding the optimal cluster centers for a given dataset. In CSS algorithm, while the Coulomb and Gauss laws from electrostatics are applied to initiate the local search, global search is performed using Newton second law of motion from mechanics. The efficiency and capability of the proposed algorithm is tested on seven datasets and compared with existing algorithms like K-Means, GA, PSO and ACO. From the experimental results, it is found that the proposed algorithm provides more accurate and effective results in comparison to other existing algorithms.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Gauss-newton search"

1

Gao, G., F. Saaf, J. Vink, M. Krymskaya, and T. Wells. "Gauss-Newton Trust Region Search Optimization Method for Least Squares Problems with Singular Hessian." In ECMOR XVII. European Association of Geoscientists & Engineers, 2020. http://dx.doi.org/10.3997/2214-4609.202035136.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Zhang, Guanglu, Douglas Allaire, and Jonathan Cagan. "An Initial Guess Free Method for Least Squares Parameter Estimation in Nonlinear Models." In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22047.

Full text
Abstract:
Abstract Fitting models to data is critical in many science and engineering fields. A major task in fitting models to data is to estimate the value of each parameter in a given model. Iterative methods, such as the Gauss-Newton method and the Levenberg-Marquardt method, are often employed for parameter estimation in nonlinear models. However, practitioners must guess the initial value for each parameter in order to initialize these iterative methods. A poor initial guess can contribute to non-convergence of these methods or lead these methods to converge to a wrong solution. In this paper, an initial guess free method is introduced to find the optimal parameter estimators in a nonlinear model that minimizes the squared error of the fit. The method includes three algorithms that require different level of computational power to find the optimal parameter estimators. The method constructs a solution interval for each parameter in the model. These solution intervals significantly reduce the search space for optimal parameter estimators. The method also provides an empirical probability distribution for each parameter, which is valuable for parameter uncertainty assessment. The initial guess free method is validated through a case study in which Fick’s second law is fit to an experimental data set. This case study shows that the initial guess free method can find the optimal parameter estimators efficiently. A four-step procedure for implementing the initial guess free method in practice is also outlined.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Gauss-newton search' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography