Log in

Relevant bibliographies by topics / Refinement method

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Refinement method'

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:

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

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 "Refinement method"

1

David, William I. F. "On the equivalence of the Rietveld method and the correlated integrated intensities method in powder diffraction." Journal of Applied Crystallography 37, no. 4 (July 17, 2004): 621–28. http://dx.doi.org/10.1107/s0021889804013184.

Full text

Abstract:

The Rietveld method is the most straightforward and statistically correct approach for the refinement of crystal structure parameters from powder diffraction data. The equivalent two-stage approach, involving the refinement of structural parameters based on integrated intensities extracted using the Pawley method, is extremely useful in circumstances such as the global optimization methods of structure determination, where a great many refinements need to be performed very quickly. The equivalence is emphasized in a simple mathematical relationship between the goodness of fits obtained in Rietveld, Pawley and correlated integrated intensities refinements. A rationale is given for determining the estimated standard deviations for structural variables from powder diffraction data.

APA, Harvard, Vancouver, ISO, and other styles

2

B�rger, Egon. "The ASM Refinement Method." Formal Aspects of Computing 15, no. 2-3 (November 1, 2003): 237–57. http://dx.doi.org/10.1007/s00165-003-0012-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Zeitler, Todd R., and Brian H. Toby. "Parallel processing for Rietveld refinement." Journal of Applied Crystallography 35, no. 2 (March 22, 2002): 191–95. http://dx.doi.org/10.1107/s0021889802000109.

Full text

Abstract:

A method for speeding Rietveld refinements using parallel computing is presented. The method can be applied to most, if not all, Rietveld refinement programs. An example implementation for the Los AlamosGeneral Structure Analysis System(GSAS) package is described. Using a cluster with seven processors, least-squares refinements are completed 2.5 to 5 times faster than on an equivalent single-processor computer.

APA, Harvard, Vancouver, ISO, and other styles

4

HAH, ZOO-HWAN, HYUN-JUNG KIM, and SUNG-KIE YOUN. "A HIERARCHICALLY SUPERIMPOSING LOCAL REFINEMENT METHOD FOR ISOGEOMETRIC ANALYSIS." International Journal of Computational Methods 11, no. 05 (October 2014): 1350074. http://dx.doi.org/10.1142/s0219876213500746.

Full text

Abstract:

In isogeometric analysis, the tensor-product form of Nonuniform Rational B-spline (NURBS) represents spline surfaces. Due to the nature of the tensor-product, the local refinement in isogeometric analysis has many issues to be resolved. Attempts have been made in this regard, such as T-splines and hierarchical approaches. In this work, a local refinement method for isogeometric analysis based on a superimposing concept is proposed. Local refinements are performed by superimposing hierarchically-created finer overlay meshes onto the regions of high error rather than a change of analysis basis (from NURBS to some other spline space). To employ the superimposing concept as a local refinement strategy in isogeometric analysis, a hierarchical framework to construct overlay meshes is developed, and compatibility conditions across the interfacial boundaries of different levels of meshes is discussed. Through numerical examples, the effectiveness and validity of the proposed method are demonstrated.

APA, Harvard, Vancouver, ISO, and other styles

5

Sato, T. "Maximum-entropy method: phase refinement." Acta Crystallographica Section A Foundations of Crystallography 48, no. 6 (November 1, 1992): 842–50. http://dx.doi.org/10.1107/s0108767392005336.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Patterson, Michael A., William W. Hager, and Anil V. Rao. "Aphmesh refinement method for optimal control." Optimal Control Applications and Methods 36, no. 4 (February 28, 2014): 398–421. http://dx.doi.org/10.1002/oca.2114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dessalew, Gashaye, Tesfaye Kebede, Gurju Awgichew, and Assaye Walelign. "Refinement of Multiparameters Overrelaxation (RMPOR) Method." Journal of Mathematics 2021 (August 23, 2021): 1–10. http://dx.doi.org/10.1155/2021/2804698.

Full text

Abstract:

In this paper, we present refinement of multiparameters overrelaxation (RMPOR) method which is used to solve the linear system of equations. We investigate its convergence properties for different matrices such as strictly diagonally dominant matrix, symmetric positive definite matrix, and M-matrix. The proposed method minimizes the number of iterations as compared with the multiparameter overrelaxation method. Its spectral radius is also minimum. To show the efficiency of the proposed method, we prove some theorems and take some numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

8

Høier, R., C. R. Birkeland, R. Holmestad, and K. Marthinsen. "Three-phase structure invariants and structure factors determined with the quantitative convergent-beam electron diffraction method." Acta Crystallographica Section A Foundations of Crystallography 55, no. 2 (March 1, 1999): 188–96. http://dx.doi.org/10.1107/s0108767398008903.

Full text

Abstract:

Quantitative convergent-beam electron diffraction is used to determine structure factors and three-phase structure invariants. The refinements are based on centre-disc intensities only. An algorithm for parameter-sensitive pixel sampling of experimental intensities is implemented in the refinement procedure to increase sensitivity and computer speed. Typical three-beam effects are illustrated for the centrosymmetric case. The modified refinement method is applied to determine amplitudes and three-phase structure invariants in noncentrosymmetric InP. The accuracy of the results is shown to depend on the choice of the initial parameters in the refinement. Even unrealistic starting assumptions and incorrect temperature factor lead to stable results for the structure invariant. The examples show that the accuracy varies from 1 to 10° in the electron three-phase invariants determined and from 0.5 to 5% for the amplitudes. Individual phases could not be determined in the present case owing to spatial intensity correlations between phase-sensitive pixels. However, for the three-phase structure invariant, stable solutions were found.

APA, Harvard, Vancouver, ISO, and other styles

9

Ida, Takashi, and Fujio Izumi. "Analytical method for observed powder diffraction intensity data based on maximum likelihood estimation." Powder Diffraction 28, no. 2 (April 16, 2013): 124–26. http://dx.doi.org/10.1017/s0885715613000195.

Full text

Abstract:

A new methodology based on maximum likelihood estimation for structure refinement using powder diffraction data is proposed. The method can not only optimize the parameters adjusted in Rietveld refinement but also parameters to specify errors in a model for statistical properties of the observed intensity. The results of structure refinements with relation to fluorapatite Ca5(PO4)3F, anglesite PbSO4, and barite BaSO4 are demonstrated. The structure parameters of fluorapatite and barite optimized by the new method are closer to single-crystal data than those optimized by the Rietveld method, while the structure parameters of anglesite, whose values optimized by the Rietveld method are already in good agreement with the single-crystal data, are almost unchanged by the application of the new method.

APA, Harvard, Vancouver, ISO, and other styles

10

Krause, Lennard, Benedikt Niepötter, Christian J. Schürmann, Dietmar Stalke, and Regine Herbst-Irmer. "Validation of experimental charge-density refinement strategies: when do we overfit?" IUCrJ 4, no. 4 (May 24, 2017): 420–30. http://dx.doi.org/10.1107/s2052252517005103.

Full text

Abstract:

A cross-validation method is supplied to judge between various strategies in multipole refinement procedures. Its application enables straightforward detection of whether the refinement of additional parameters leads to an improvement in the model or an overfitting of the given data. For all tested data sets it was possible to prove that the multipole parameters of atoms in comparable chemical environments should be constrained to be identical. In an automated approach, this method additionally delivers parameter distributions ofkdifferent refinements. These distributions can be used for further error diagnostics,e.g.to detect erroneously defined parameters or incorrectly determined reflections. Visualization tools show the variation in the parameters. These different refinements also provide rough estimates for the standard deviation of topological parameters.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Refinement method"

1

Grinspun, Eitan Schröder Peter. "The basis refinement method /." Diss., Pasadena, Calif. : California Institute of Technology, 2003. http://resolver.caltech.edu/CaltechETD:etd-05312003-133558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grundy, Jim. "A method of program refinement." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.309324.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Antepara, Zambrano Oscar Luis. "Adaptive mesh refinement method for CFD applications." Doctoral thesis, Universitat Politècnica de Catalunya, 2019. http://hdl.handle.net/10803/664931.

Full text

Abstract:

The main objective of this thesis is the development of an adaptive mesh refinement (AMR) algorithm for computational fluid dynamics simulations using hexahedral and tetrahedral meshes. This numerical methodology is applied in the context of large-eddy simulations (LES) of turbulent flows and direct numerical simulations (DNS) of interfacial flows, to bring new numerical research and physical insight. For the fluid dynamics simulations, the governing equations, the spatial discretization on unstructured grids and the numerical schemes for solving Navier-Stokes equations are presented. The equations follow a discretization by conservative finite-volume on collocated meshes. For the turbulent flows formulation, the spatial discretization preserves symmetry properties of the continuous differential operators and the time integration follows a self-adaptive strategy, which has been well tested on unstructured grids. Moreover, LES model consisting of a wall adapting local-eddy-viscosity within a variational multi-scale formulation is used for the applications showed in this thesis. For the two-phase flow formulation, a conservative level-set method is applied for capturing the interface between two fluids and is implemented with a variable density projection scheme to simulate incompressible two-phase flows on unstructured meshes. The AMR algorithm developed in this thesis is based on a quad/octree data structure and keeps a relation of 1:2 between levels of refinement. In the case of tetrahedral meshes, a geometrical criterion is followed to keep the quality metric of the mesh on a reasonable basis. The parallelization strategy consists mainly in the creation of mesh elements in each sub-domain and establishes a unique global identification number, to avoid duplicate elements. Load balance is assured at each AMR iteration to keep the parallel performance of the CFD code. Moreover, a mesh multiplication algorithm (MM) is reported to create large meshes, with different kind of mesh elements, but preserving the topology from a coarser original mesh. This thesis focuses on the study of turbulent flows and two-phase flows using an AMR framework. The cases studied for LES of turbulent flows applications are the flow around one and two separated square cylinders, and the flow around a simplified car model. In this context, a physics-based refinement criterion is developed, consisting of the residual velocity calculated from a multi-scale decomposition of the instantaneous velocity. This criteria ensures grid adaptation following the main vortical structures and giving enough mesh resolution on the zones of interest, i.e., flow separation, turbulent wakes, and vortex shedding. The cases studied for the two-phase flows are the DNS of 2D and 3D gravity-driven bubble, with a particular focus on the wobbling regime. A study of rising bubbles in the wobbling regime and the effect of dimensionless numbers on the dynamic behavior of the bubbles are presented. Moreover, the use of tetrahedral AMR is applied for the numerical simulation of gravity-driven bubbles in complex domains. On this topic, the methodology is validated on bubbles rising in cylindrical channels with different topology, where the study of these cases contributed to having new numerical research and physical insight in the development of a rising bubble with wall effects.
El objetivo principal de esta tesis es el desarrollo de un algoritmo adaptativo de refinamiento de malla (AMR) para simulaciones de dinámica de fluidos computacional utilizando mallas hexaédricas y tetraédricas. Esta metodología numérica se aplica en el contexto de simulaciones Large-eddie (LES) de flujos turbulentos y simulaciones numéricas directas (DNS) de flujos interfaciales, para traer nuevas investigaciones numéricas y entendimiento físicas. Para las simulaciones de dinámica de fluidos, se presentan las ecuaciones governantes, la discretización espacial en mallas no estructuradas y los esquemas numéricos para resolver las ecuaciones de Navier-Stokes. Las ecuaciones siguen una discretización conservativa por volumenes finitos en mallas colocadas. Para la formulación de flujos turbulentos, la discretización espacial preserva las propiedades de simetría de los operadores diferenciales continuos y la integración de tiempo sigue una estrategia autoadaptativa, que ha sido bien probada en mallas no estructuradas. Además, para las aplicaciones que se muestran en esta tesis, se utiliza el modelo LES que consiste en una viscosidad local que se adapta a la pared dentro de una formulación multiescala variable. Para la formulación de flujo de dos fases, se aplica un método de conjunto de niveles conservador para capturar la interfaz entre dos fluidos y se implementa con un esquema de proyección de densidad variable para simular flujos de dos fases incompresibles en mallas no estructuradas. El algoritmo AMR desarrollado en esta tesis se basa en una estructura de datos de quad / octree y mantiene una relación de 1: 2 entre los niveles de refinamiento. En el caso de las mallas tetraédricas, se sigue un criterio geométrico para mantener la calidad de la malla en una base razonable. La estrategia de paralelización consiste principalmente en la creación de elementos de malla en cada subdominio y establece un número de identificación global único, para evitar elementos duplicados. El equilibrio de carga está asegurado en cada iteración de AMR para mantener el rendimiento paralelo del código CFD. Además, se ha desarrollado un algoritmo de multiplicación de malla (MM) para crear mallas grandes, con diferentes tipos de elementos de malla, pero preservando la topología de una malla original más pequeña. Esta tesis se centra en el estudio de flujos turbulentos y flujos de dos fases utilizando un marco AMR. Los casos estudiados para aplicaciones de LES de flujos turbulentos son el flujo alrededor de uno y dos cilindros separados de sección cuadrada, y el flujo alrededor de un modelo de automóvil simplificado. En este contexto, se desarrolla un criterio de refinamiento basado en la física, que consiste en la velocidad residual calculada a partir de una descomposición de escala múltiple de la velocidad instantánea. Este criterio garantiza la adaptación de la malla siguiendo las estructuras vorticales principales y proporcionando una resolución de malla suficiente en las zonas de interés, es decir, separación de flujo, estelas turbulentas y desprendimiento de vórtices. Los casos estudiados para los flujos de dos fases son el DNS de la burbuja impulsada por la gravedad en 2D y 3D, con un enfoque particular en el régimen de oscilación. Además, el uso de AMR tetraédrico se aplica para la simulación numérica de burbujas impulsadas por la gravedad en dominios complejos. En este tema, la metodología se valida en burbujas que ascienden en canales cilíndricos con topología diferente, donde el estudio de estos casos contribuyó a tener una nueva investigación numérica y una visión física en el desarrollo de una burbuja con efectos de pared.

APA, Harvard, Vancouver, ISO, and other styles

4

Lai, Albert Y. C. "A tool for a formal refinement method." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0019/MQ49738.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Offermans, Nicolas. "Towards adaptive mesh refinement in Nek5000." Licentiate thesis, KTH, Mekanik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-217501.

Full text

Abstract:

The development of adaptive mesh refinement capabilities in the field of computational fluid dynamics is an essential tool for enabling the simulation of larger and more complex physical problems. While such techniques have been known for a long time, most simulations do not make use of them because of the lack of a robust implementation. In this work, we present recent progresses that have been made to develop adaptive mesh refinement features in Nek5000, a code based on the spectral element method. These developments are driven by the algorithmic challenges posed by future exascale supercomputers. First, we perform the study of the strong scaling of Nek5000 on three petascale machines in order to assess the scalability of the code and identify the current bottlenecks. It is found that strong scaling limit ranges between 5, 000 and 220, 000 degrees of freedom per core depending on the machine and the case. The need for synchronized and low latency communication for efficient computational fluid dynamics simulation is also confirmed. Additionally, we present how Hypre, a library for linear algebra, is used to develop a new and efficient code for performing the setup step required prior to the use of an algebraic multigrid solver for preconditioning the pressure equation in Nek5000. Finally, the main objective of this work is to develop new methods for estimating the error on a numerical solution of the Navier–Stokes equations via the resolution of an adjoint problem. These new estimators are compared to existing ones, which are based on the decay of the spectral coefficients. Then, the estimators are combined with newly implemented capabilities in Nek5000 for automatic grid refinement and adaptive mesh adaptation is carried out. The applications considered so far are steady and two-dimensional, namely the lid-driven cavity at Re = 7, 500 and the flow past a cylinder at Re = 40. The use of adaptive mesh refinement techniques makes mesh generation easier and it is shown that a similar accuracy as with a static mesh can be reached with a significant reduction in the number of degrees of freedom.

QC 20171114

APA, Harvard, Vancouver, ISO, and other styles

6

Demircioglu, Ersan. "A Novel Refinement Method For Automatic Image Annotation Systems." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613346/index.pdf.

Full text

Abstract:

Image annotation could be defined as the process of assigning a set of content related words to the image. An automatic image annotation system constructs the relationship between words and low level visual descriptors, which are extracted from images and by using these relationships annotates a newly seen image. The high demand on image annotation requirement increases the need to automatic image annotation systems. However, performances of current annotation methods are far from practical usage. The most common problem of current methods is the gap between semantic words and low level visual descriptors. Because of the semantic gap, annotation results of these methods contain irrelevant noisy words. To give more relevant results, refinement methods should be applied to classical image annotation outputs. In this work, we represent a novel refinement approach for image annotation problem. The proposed system attacks the semantic gap problem by using the relationship between the words which are obtained from the dataset. Establishment of this relationship is the most crucial problem of the refinement process. In this study, we suggest a probabilistic and fuzzy approach for modelling the relationship among the words in the vocabulary, which is then employed to generate candidate annotations, based on the output of the image annotator. Candidate annotations are represented by a set of relational graphs. Finally, one of the generated candidate annotations is selected as a refined annotation result by using a clique optimization technique applied to the candidate annotation graph.

APA, Harvard, Vancouver, ISO, and other styles

7

Lau, Tsan-sun, and 劉燦燊. "Adaptive finite element refinement analysis of shell structures." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1999. http://hub.hku.hk/bib/B31238798.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Morgenstern, Philipp [Verfasser]. "Mesh Refinement Strategies for the Adaptive Isogeometric Method / Philipp Morgenstern." Bonn : Universitäts- und Landesbibliothek Bonn, 2017. http://d-nb.info/1140525948/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Tahiri, Ahmed. "A compact discretization method for diffusion problems with local refinement." Doctoral thesis, Universite Libre de Bruxelles, 2002. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/211417.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Preissig, R. Stephen. "Local p refinement in two dimensional vector finite elements." Thesis, Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/13739.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Books on the topic "Refinement method"

1

Widlund, Olof. Optimal iterative refinement method. New York: Courant Institute of Mathematical Sciences, New York University, 1988.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lai, Albert Y. C. A tool for a formal refinement method. Ottawa: National Library of Canada, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Bänsch, Eberhard. Local mesh refinement in 2 and 3 dimensions. Bonn: Rheinische Friedrich-Wilhelms-Universität, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Dryja, Maksymilian. On the optimality of an additive iterative refinement method. New York: Courant Institute of Mathematical Sciences, New York University, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Dryja, Maksymilian. On the optimality of an additive iterative refinement method. New York: Courant Institute of Mathematical Sciences, New York University, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chavannes, Nicolas Pierre. Local mesh refinement algorithms for enhanced modeling capabilities in the FDTD method. Konstanz: Hartung-Gorre, 2002.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mitchell, William F. A comparison of adaptive refinement techniques for elliptic problems. Urbana, IL (1304 W. Springfield Ave., Urbana 61801): Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1987.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Jackson, Christopher Robert. A novel grid refinement method for regional groundwater flow using object-oriented technology. Birmingham: University of Birmingham, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Garrood, Stuart Thomas. The refinement and testing of a method for the augmentation of flight simulator motion due to turbulence. [Downsview, Ont.]: Dept. of Aerospace Science and Engineering, University of Toronto, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Garrood, Stuart Thomas. The refinement and testing of a method for the augmentation of flight simulator motion due to turbulence. Ottawa: National Library of Canada = Bibliothèque nationale du Canada, 1993.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Refinement method"

1

Robinson, Ken A. "Introduction to the B Method." In Program Development by Refinement, 3–37. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0585-5_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bureš, Tomáš, Ilias Gerostathopoulos, Petr Hnetynka, Jaroslav Keznikl, Michal Kit, and Frantisek Plasil. "The Invariant Refinement Method." In Software Engineering for Collective Autonomic Systems, 405–28. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-16310-9_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Butler, Michael, and Marina Waldén. "Parallel Programming with the B Method." In Program Development by Refinement, 183–95. London: Springer London, 1999. http://dx.doi.org/10.1007/978-1-4471-0585-5_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gries, David. "Lectures on Data Refinement." In Programming and Mathematical Method, 213–44. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77572-7_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Hoare, C. A. R., and He Jifeng. "Refinement algebra proves correctness of compilation." In Programming and Mathematical Method, 245–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-642-77572-7_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Codescu, Mihai, Bruno Langenstein, Christian Maeder, and Till Mossakowski. "The VSE Refinement Method in Hets." In Formal Methods and Software Engineering, 660–78. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-10373-5_34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Grandy, Holger, Kurt Stenzel, and Wolfgang Reif. "A Refinement Method for Java Programs." In Lecture Notes in Computer Science, 221–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-72952-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Paszyński, Maciej, Rafał Grzeszczuk, David Pardo, and Leszek Demkowicz. "Deep Learning Driven Self-adaptive Hp Finite Element Method." In Computational Science – ICCS 2021, 114–21. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-77961-0_11.

Full text

Abstract:

AbstractThe finite element method (FEM) is a popular tool for solving engineering problems governed by Partial Differential Equations (PDEs). The accuracy of the numerical solution depends on the quality of the computational mesh. We consider the self-adaptive hp-FEM, which generates optimal mesh refinements and delivers exponential convergence of the numerical error with respect to the mesh size. Thus, it enables solving difficult engineering problems with the highest possible numerical accuracy. We replace the computationally expensive kernel of the refinement algorithm with a deep neural network in this work. The network learns how to optimally refine the elements and modify the orders of the polynomials. In this way, the deterministic algorithm is replaced by a neural network that selects similar quality refinements in a fraction of the time needed by the original algorithm.

APA, Harvard, Vancouver, ISO, and other styles

9

Potet, Marie Laure, and Yann Rouzaud. "Composition and refinement in the B-method." In Lecture Notes in Computer Science, 46–65. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0053355.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Wei, Zhao, Yanli Lv, Chunhe Xia, Yang Luo, and Qing Wei. "A Computer Network Defense Policy Refinement Method." In Frontiers in Internet Technologies, 122–33. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53959-6_12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Refinement method"

1

Hu, Jun, and Yajun Fu. "Research on Policy Refinement Method." In 2008 International Conference on Cyberworlds (CW). IEEE, 2008. http://dx.doi.org/10.1109/cw.2008.78.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grisham, James R., Nandakumar Vijayakumar, Guojun Liao, Brian H. Dennis, and Frank K. Lu. "A Comparison Between Local h-Refinement and a Novel r-Refinement Method." In 53rd AIAA Aerospace Sciences Meeting. Reston, Virginia: American Institute of Aeronautics and Astronautics, 2015. http://dx.doi.org/10.2514/6.2015-2040.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

van Keulen, Fred, Vassili Toropov, and Valery Markine. "Recent Refinements in the Multi-Point Approximation Method in Conjunction With Adaptive Mesh Refinement." In ASME 1996 Design Engineering Technical Conferences and Computers in Engineering Conference. American Society of Mechanical Engineers, 1996. http://dx.doi.org/10.1115/96-detc/dac-1451.

Full text

Abstract:

Abstract Application of the Multi-point Approximation Method (MAM) to structural optimization is considered. Structural analyses are performed by means of the finite element method with Adaptive Mesh Refinement (AMR). The required discretization errors are changed during the optimization process to achieve a higher computational efficiency. A straightforward combination of the MAM and AMR may yield complications, which are discussed in detail. Therefore, several modifications in the MAM are necessary. An alternative strategy for determining the explicit approximation functions using a weighted least-squares fitting is proposed. The applied weight coefficients reflect the levels of the discretization errors. The approximation functions are fitted with a sub-set of the available structural response analyses. An alternative move limit strategy is given. On the basis of several numerical examples it is shown that the proposed modifications improve the convergence characteristics of the MAM when combined with AMR. Moreover it is demonstrated that the proposed refinements are also beneficial for optimization of systems with noisy objective and constraint functions.

APA, Harvard, Vancouver, ISO, and other styles

4

Pismak, Alexey, Serge Klimenkov, Eugeny Tsopa, Alexandr Yarkeev, Vladimir Nikolaev, and Anton Gavrilov. "Method of Semantic Refinement for Enterprise Search." In 12th International Conference on Knowledge Engineering and Ontology Development. SCITEPRESS - Science and Technology Publications, 2020. http://dx.doi.org/10.5220/0010159703070312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Guangquan, Mei Rong, Yali He, Xueyang Zhu, and Rongjie Yan. "A Refinement Checking Method of Web Services Composition." In 2010 Fifth International Symposium on Service Oriented System Engineering (SOSE). IEEE, 2010. http://dx.doi.org/10.1109/sose.2010.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Ramadhani, Afifah Dwi, Prima Kristalina, and Amang Sudarsono. "Performance Evaluation of Refinement Method in Indoor Localization." In 2018 International Electronics Symposium on Engineering Technology and Applications (IES-ETA). IEEE, 2018. http://dx.doi.org/10.1109/elecsym.2018.8615498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yi-Min Deng. "Applying Critical Path Method for conceptual design refinement." In 2010 2nd International Conference on Mechanical and Electronics Engineering (ICMEE 2010). IEEE, 2010. http://dx.doi.org/10.1109/icmee.2010.5558531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bingzhi Gao, Xiaojuan Ban, Qiang Lv, and Xiaoli Li. "A component-based method for software architecture refinement." In 2010 International Conference on Intelligent Control and Information Processing (ICICIP 2010). IEEE, 2010. http://dx.doi.org/10.1109/icicip.2010.5564982.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

C. Lesage, A., R. Aubry, G. Houzeaux, M. Araya Polo, and J. M. Cela. "3D Spectral Element Method Combined With H–refinement." In 72nd EAGE Conference and Exhibition incorporating SPE EUROPEC 2010. European Association of Geoscientists & Engineers, 2010. http://dx.doi.org/10.3997/2214-4609.201400702.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Mei, Xiaoyong, Aijun Jiang, Fudan Zheng, and Shixian Li. "Reliable Transactional Web Service Composition Using Refinement Method." In 2009 WASE International Conference on Information Engineering (ICIE). IEEE, 2009. http://dx.doi.org/10.1109/icie.2009.169.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Refinement method"

1

S.C. James, J.E. Dickinson, S.W. Mehl, M.C. Hill, S.A. Leake, G.A. zyvoloski, and A. Eddebbarh. NEW GHOST-NODE METHOD FOR LINKING DIFFERENT MODELS WITH VARIED GRID REFINEMENT. Office of Scientific and Technical Information (OSTI), February 2006. http://dx.doi.org/10.2172/884895.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

J. dickinson, S.C. James, S. Mehl, M.C. Hill, S. Leake, and G.A. Zyvoloski. A NEW GHOST-NODE METHOD FOR LINKING DIFFERENT MODELS WITH VARIED GRID REFINEMENT. Office of Scientific and Technical Information (OSTI), October 2005. http://dx.doi.org/10.2172/884931.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Jeffords, Ralph, Constance Heitmeyer, Myla Archer, and Elizabeth Leonard. A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition. Fort Belvoir, VA: Defense Technical Information Center, January 2009. http://dx.doi.org/10.21236/ada525368.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Martín, A., L. Cirrottola, A. Froehly, R. Rossi, and C. Soriano. D2.2 First release of the octree mesh-generation capabilities and of the parallel mesh adaptation kernel. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.010.

Full text

Abstract:

This document presents a description of the octree mesh-generation capabilities and of the parallel mesh adaptation kernel. As it is discussed in Section 1.3.2 of part B of the project proposal there are two parallel research lines aimed at developing scalable adaptive mesh refinement (AMR) algorithms and implementations. The first one is based on using octree-based mesh generation and adaptation for the whole simulation in combination with unfitted finite element methods (FEMs) and the use of algebraic constraints to deal with non-conformity of spaces. On the other hand the second strategy is based on the use of an initial octree mesh that, after make it conforming through the addition of templatebased tetrahedral refinements, is adapted anisotropically during the calculation. Regarding the first strategy the following items are included:

APA, Harvard, Vancouver, ISO, and other styles

5

Guzik, S., and X. Gao. Adaptive Mesh Refinement for Parallel in Time Methods. Office of Scientific and Technical Information (OSTI), May 2021. http://dx.doi.org/10.2172/1784604.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Saltzman, J. Patched based methods for adaptive mesh refinement solutions of partial differential equations. Office of Scientific and Technical Information (OSTI), September 1997. http://dx.doi.org/10.2172/584924.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Zhilin, and Kazufumi Ito. Finite Element Methods and Iterative Refinement Techniques for Partial Differential Equations Involving Interfaces. Fort Belvoir, VA: Defense Technical Information Center, March 2003. http://dx.doi.org/10.21236/ada413105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Ayoul-Guilmard, Q., S. Ganesh, M. Nuñez, R. Tosi, F. Nobile, R. Rossi, and C. Soriano. D5.3 Report on theoretical work to allow the use of MLMC with adaptive mesh refinement. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.002.

Full text

Abstract:

This documents describes several studies undertaken to assess the applicability of MultiLevel Monte Carlo (MLMC) methods to problems of interest; namely in turbulent fluid flow over civil engineering structures. Several numerical experiments are presented wherein the convergence of quantities of interest with mesh parameters are studied at different Reynolds’ numbers and geometries. It was found that MLMC methods could be used successfully for low Reynolds’ number flows when combined with appropriate Adaptive Mesh Refinement (AMR) strategies. However, the hypotheses for optimal MLMC performance were found to not be satisfied at higher turbulent Reynolds’ numbers despite the use of AMR strategies. Recommendations are made for future research directions based on these studies. A tentative outline for an MLMC algorithm with adapted meshes is made, as well as recommendations for alternatives to MLMC methods for cases where the underlying assumptions for optimal MLMC performance are not satisfied.

APA, Harvard, Vancouver, ISO, and other styles

9

Lee, B. T. Evaluation and refinement of test methods used for measuring fire hazards of shipboard hull insulations and mattress insert foams. Gaithersburg, MD: National Bureau of Standards, 1985. http://dx.doi.org/10.6028/nbs.ir.85-3148.

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!