Hunter et al 2023a - Revision history

JSanchez at 10:20, 24 May 2023

2023-05-24T10:20:42Z

JSanchez at 10:20, 24 May 2023

2023-05-24T10:20:32Z

JSanchez: JSanchez moved page Draft Sanchez Pinedo 795147883 to Hunter et al 2023a

2023-05-24T10:13:33Z

JSanchez moved page Draft Sanchez Pinedo 795147883 to Hunter et al 2023a

JSanchez at 09:54, 24 May 2023

2023-05-24T09:54:44Z

JSanchez: Created blank page

2023-05-24T09:54:41Z

Created blank page

New page

@@ Line 1: / Line 1: @@
 ==Abstract==
-Numerical simulations and optimisation methods, such as mesh adaptation, rely on the accurate and inexpensive use of error estimation methods. Adjoint-based error estimation is the most accurate method, and generally the most costly. A strong contributor to this cost is the need to compute a higher resolution adjoint solution, using time dependent information. Here, recontruction methods applied to the primal and adjoint solutions are proposed to alleviate both the storage footprint of the primal problem and the adjoint computational cost. The method is compared to reference error estimators on an unsteady Burgers’ equation using the method of manufactured solutions. Two reconstruction methods, a proper orthogonal decomposition and a static convolutional neural network were used to demonstrate both the computational cost reduction and the potential for the reduction of the storage footprint of the primal problem. When reconstruction methods are applied to the primal problem, one can use both proposed approaches to reduce the footprint of the solution and reconstruct the effectively compressed primal solution to be recalled for the adjoint solution. The second approach consists in solving an adjoint solution from a coarse primal solution and using reconstruction methods to obtain a higher resolution adjoint solution, necessary for output error estimation and mesh adap�tation. The obtained results give great confidence in the use of reconstruction methods for the reduction of both computational cost and storage requirements of adjoint-based error estimation, and goal-oriented mesh adaptation
+Numerical simulations and optimisation methods, such as mesh adaptation, rely on the accurate and inexpensive use of error estimation methods. Adjoint-based error estimation is the most accurate method, and generally the most costly. A strong contributor to this cost is the need to compute a higher resolution adjoint solution, using time dependent information. Here, recontruction methods applied to the primal and adjoint solutions are proposed to alleviate both the storage footprint of the primal problem and the adjoint computational cost. The method is compared to reference error estimators on an unsteady Burgers’ equation using the method of manufactured solutions. Two reconstruction methods, a proper orthogonal decomposition and a static convolutional neural network were used to demonstrate both the computational cost reduction and the potential for the reduction of the storage footprint of the primal problem. When reconstruction methods are applied to the primal problem, one can use both proposed approaches to reduce the footprint of the solution and reconstruct the effectively compressed primal solution to be recalled for the adjoint solution. The second approach consists in solving an adjoint solution from a coarse primal solution and using reconstruction methods to obtain a higher resolution adjoint solution, necessary for output error estimation and mesh adaptation. The obtained results give great confidence in the use of reconstruction methods for the reduction of both computational cost and storage requirements of adjoint-based error estimation, and goal-oriented mesh adaptation
-−
 == Full Paper ==
 <pdf>Media:Draft_Sanchez Pinedo_7951478839_file.pdf</pdf>

← Older revision		Revision as of 10:20, 24 May 2023
Line 1:		Line 1:
		+	==Abstract==
		+
		+	Numerical simulations and optimisation methods, such as mesh adaptation, rely on the accurate and inexpensive use of error estimation methods. Adjoint-based error estimation is the most accurate method, and generally the most costly. A strong contributor to this cost is the need to compute a higher resolution adjoint solution, using time dependent information. Here, recontruction methods applied to the primal and adjoint solutions are proposed to alleviate both the storage footprint of the primal problem and the adjoint computational cost. The method is compared to reference error estimators on an unsteady Burgers’ equation using the method of manufactured solutions. Two reconstruction methods, a proper orthogonal decomposition and a static convolutional neural network were used to demonstrate both the computational cost reduction and the potential for the reduction of the storage footprint of the primal problem. When reconstruction methods are applied to the primal problem, one can use both proposed approaches to reduce the footprint of the solution and reconstruct the effectively compressed primal solution to be recalled for the adjoint solution. The second approach consists in solving an adjoint solution from a coarse primal solution and using reconstruction methods to obtain a higher resolution adjoint solution, necessary for output error estimation and mesh adap�tation. The obtained results give great confidence in the use of reconstruction methods for the reduction of both computational cost and storage requirements of adjoint-based error estimation, and goal-oriented mesh adaptation
		+
		+
	== Full Paper ==		== Full Paper ==
	<pdf>Media:Draft_Sanchez Pinedo_7951478839_file.pdf</pdf>		<pdf>Media:Draft_Sanchez Pinedo_7951478839_file.pdf</pdf>

← Older revision	Revision as of 09:54, 24 May 2023
Line 1:	Line 1:
−	+	== Full Paper ==
	+	<pdf>Media:Draft_Sanchez Pinedo_7951478839_file.pdf</pdf>

← Older revision	Revision as of 10:13, 24 May 2023
(No difference)