Academic literature on the topic 'Reparameterisation'

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Reparameterisation.'

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 "Reparameterisation"

1

Tan, Willie. "LEAST SQUARES ADJUSTMENT THROUGH REPARAMETERISATION." Survey Review 36, no. 283 (January 2002): 362–66. http://dx.doi.org/10.1179/sre.2002.36.283.362.

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

Shao, Quanxi. "A REPARAMETERISATION METHOD FOR EMBEDDED MODELS." Communications in Statistics - Theory and Methods 31, no. 5 (May 23, 2002): 683–97. http://dx.doi.org/10.1081/sta-120003647.

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

Steel, S. J., and N. J. le Roux. "A Reparameterisation Of A Bivariate Gamma Extension." Communications in Statistics - Theory and Methods 16, no. 1 (January 1987): 293–305. http://dx.doi.org/10.1080/03610928708829366.

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

Hoidn, Hans-Peter. "A reparameterisation method to determine conformal maps." Journal of Computational and Applied Mathematics 14, no. 1-2 (February 1986): 155–61. http://dx.doi.org/10.1016/0377-0427(86)90136-6.

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

Gunn, Roger N., Michael J. Chappell, and Vincent J. Cunningham. "Reparameterisation of Unidentifiable Systems using the Taylor Series Approach." IFAC Proceedings Volumes 30, no. 2 (March 1997): 247–52. http://dx.doi.org/10.1016/s1474-6670(17)44579-4.

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

Sharkey, Paul, and Jonathan A. Tawn. "A Poisson process reparameterisation for Bayesian inference for extremes." Extremes 20, no. 2 (December 17, 2016): 239–63. http://dx.doi.org/10.1007/s10687-016-0280-2.

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

Luke, Michael, and Aneesh V. Manohar. "Reparameterisation invariance constraints on heavy particle effective field theories." Physics Letters B 286, no. 3-4 (July 1992): 348–54. http://dx.doi.org/10.1016/0370-2693(92)91786-9.

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

Ramroach, Sterling, and Ajay Joshi. "Accelerating Data-Parallel Neural Network Training with Weighted-Averaging Reparameterisation." Parallel Processing Letters 31, no. 02 (May 6, 2021): 2150009. http://dx.doi.org/10.1142/s0129626421500092.

Full text
Abstract:
Recent advances in artificial intelligence has shown a direct correlation between the performance of a network and the number of hidden layers within the network. The Compute Unified Device Architecture (CUDA) framework facilitates the movement of heavy computation from the CPU to the graphics processing unit (GPU) and is used to accelerate the training of neural networks. In this paper, we consider the problem of data-parallel neural network training. We compare the performance of training the same neural network on the GPU with and without data parallelism. When data parallelism is used, we compare with both the conventional averaging of coefficients and our proposed method. We set out to show that not all sub-networks are equal and thus, should not be treated as equals when normalising weight vectors. The proposed method achieved state of the art accuracy faster than conventional training along with better classification performance in some cases.
APA, Harvard, Vancouver, ISO, and other styles
9

Korsgaard, Inge, Anders Andersen, and Daniel Sorensen. "A useful reparameterisation to obtain samples from conditional inverse Wishart distributions." Genetics Selection Evolution 31, no. 2 (1999): 177. http://dx.doi.org/10.1186/1297-9686-31-2-177.

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

Robert, Christian P., and Kerrie L. Mengersen. "Reparameterisation Issues in Mixture Modelling and their bearing on MCMC algorithms." Computational Statistics & Data Analysis 29, no. 3 (January 1999): 325–43. http://dx.doi.org/10.1016/s0167-9473(98)00058-9.

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

Dissertations / Theses on the topic "Reparameterisation"

1

Sayyafzadeh, Mohammad. "Uncertainty reduction in reservoir characterisation through inverse modelling of dynamic data: an evolutionary computation approach." Thesis, 2013. http://hdl.handle.net/2440/81813.

Full text
Abstract:
Precise reservoir characterisation is the basis for reliable flow performance predictions and unequivocal decision making concerning field development. History matching is an indispensable phase of reservoir characterisation in which the flow performance history is integrated into the initially constructed reservoir model to reduce uncertainties. It is a computationally intensive nonlinear inverse problem and typically suffers from illposedness. Developing an efficient automatic history matching framework is the core goal of almost all studies on this subject. To overcome some of the existing challenges in history matching, this thesis introduces new techniques which are mostly based on evolutionary computation concepts. In order to examine the techniques, in the beginning, the foundations of an automatic history matching framework are developed in which a reservoir simulator (ECLIPSE) is coupled with a programming language (MATLAB). Then, the introduced methods along with a number of conventional methods are installed on the framework, and they are compared with each other using different case studies. Thus far, numerous optimisation algorithms have been studied for history matching problems to conduct the calibration step accurately and efficiently. In this thesis, the application of a recent-developed algorithm, artificial bee colony (ABC), is assessed, for the first time. It is compared with three conventional optimisers, Levenberg-Marquette, Genetic Algorithm, and Simulated Annealing, using a synthetic reservoir model. The comparison indicates that ABC can deliver better results and is not concerned with the landscape shape of problem. The most likely reason of its success is having a suitable balance between exploration and exploitation search capability. Of course, similar to all stochastic optimisers, its main drawbacks are computational expenses and being inefficient in high-dimensional problems. Fitness approximation (proxy-modelling) approaches are common methods for reducing computational costs. All of the applied fitness approximation methods in history-matching problems use a similar approach called uncontrolled fitness approximation. It has been corroborated that the uncontrolled fitness approximation approach may mislead the optimisation direction. To prevent this issue, a new fitness approximation is developed in that a model management (evolution-control) technique is included. The results of the controlled (proposed) approach are compared with the results of conventional one using a case study (PUNQ-S3 model). It is shown that the computation can be reduced up to 75% by the proposed method. The proxy-modelling methods should be applied when the problem is not high-dimensional. None of the current formats of the applied stochastic optimisers is capable of dealing with high-dimensional problems efficiently, and they should be applied in conjunction with a reparameterisation technique which causes modelling errors. On the other hand, gradient based optimisers may be trapped into a local minimum, due to the nonlinearity of the problem. In this thesis, an inventive stochastic algorithm is developed for high-dimensional problems based on wavelet image-fusion and evolutionary algorithm concepts. The developed algorithm is compared with six algorithms (genetic algorithm with a pilot point reparameterisation, BFGS with a zonation reparameterisation, BFGS with a spectral decomposition reparameterisation, artificial bee colony, genetic algorithm and BFGS in full-parameterisation) using two different case studies. It is interesting that the best results are obtained by the introduced method. Besides, it is well-known that achieving high-quality history matched models using any of the methods depends on the reliability of objective function formulation. The most widespread approach of formulation is Bayesian framework. Because of complexities in quantifying measurement, modelling and prior model reliability, the weighting factors in the objective function may have uncertainties. The influence of these uncertainties on the outcome of history matching is studied in this thesis, and an approach is developed based on Pareto optimisation (multi-objective genetic algorithm) to deal with this issue. The approach is compared with a conventional (random selection) one. The results confirm that a high amount of computation can be saved by the Pareto approach. In last part of this thesis, a new analytical simulator is developed using the transfer function approach. The developed method does not need the expensive history matching, and it can be used for occasions that a quick forecasting is sought and/or history matching of grid-based reservoir simulation is impractical. In the developed method, it is assumed a reservoir consists of a combination of TFs, and then the order and arrangement of TFs are chosen based on the physical conditions of the reservoir ascertained by examining several cases. The results reveal a good agreement with those obtained from the grid-based simulators. An additional piece of work is done in this thesis in which the optimal infill drilling plane is estimated for a coal seam gas reservoir (semi-synthetic model constructed based on the Tiffany unit in the San Juan basin) by the use of the developed framework in which the objective function and the decision variables are set to be the net present value, and the location of infill wells, respectively.
Thesis (Ph.D.) -- University of Adelaide, Australian School of Petroleum, 2013
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Reparameterisation"

1

Neshastehriz, Amir R., Michael Cantoni, and Iman Shames. "A computationally advantageous reparameterisation of a robust model predictive control scheme." In 2014 4th Australian Control Conference (AUCC). IEEE, 2014. http://dx.doi.org/10.1109/aucc.2014.7358679.

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

Hladůvka, J., and K. Bühler. "MDL Spline Models: Gradient and Polynomial Reparameterisations." In British Machine Vision Conference 2005. British Machine Vision Association, 2005. http://dx.doi.org/10.5244/c.19.90.

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

Chappell, M. J. "Structural identifiability of controlled state space systems: a quasiautomated methodology for generating identifiable reparameterisations of unidentifiable systems." In IEE Colloquium on Symbolic Computation for Control. IEE, 1999. http://dx.doi.org/10.1049/ic:19990487.

Full text
APA, Harvard, Vancouver, ISO, and other styles
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