default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoël Chaskalovic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j16]Joël Chaskalovic, Franck Assous:
Enhancing interpolation and approximation error estimates using a novel Taylor-like formula. J. Comput. Appl. Math. 453: 116153 (2025)- [j15]Joël Chaskalovic, Franck Assous:
A refined first-order expansion formula in Rn: Application to interpolation and finite element error estimates. J. Comput. Appl. Math. 457: 116274 (2025) - 2024
- [j14]Joël Chaskalovic, Franck Assous, Hessam Jamshidipour:
A new second order Taylor-like theorem with an optimized reduced remainder. J. Comput. Appl. Math. 438: 115496 (2024) - 2023
- [i11]Joël Chaskalovic, Franck Assous:
A new second order Taylor-like theorem with an optimized reduced remainder. CoRR abs/2304.08136 (2023) - [i10]Joël Chaskalovic, Franck Assous:
Enhancing Interpolation and Approximation Error Estimates Using a Novel Taylor-like Formula. CoRR abs/2310.19483 (2023) - [i9]Joël Chaskalovic, Franck Assous:
Improved P1-interpolation error estimates in W1, p(]0, 1[): Application to finite element method. CoRR abs/2310.19639 (2023) - [i8]Joël Chaskalovic, Franck Assous:
An optimal first-order Taylor-like formula with a minimized remainder. CoRR abs/2311.13989 (2023) - 2022
- [j13]Joël Chaskalovic
, Franck Assous:
Generalized Beta Prime Distribution Applied to Finite Element Error Approximation. Axioms 11(3): 84 (2022) - [j12]Joël Chaskalovic, Hessam Jamshidipour:
A New First Order Expansion Formula with a Reduced Remainder. Axioms 11(10): 562 (2022) - [i7]Joël Chaskalovic, Franck Assous:
A refined first-order expansion formula in Rn: Application to interpolation and finite element error estimates. CoRR abs/2209.15286 (2022) - 2021
- [j11]Joël Chaskalovic:
A Probabilistic Approach for Solutions of Deterministic PDE's as Well as Their Finite Element Approximations. Axioms 10(4): 349 (2021) - [j10]Joël Chaskalovic, Franck Assous:
Numerical Validation of Probabilistic Laws to Evaluate finite element error estimates. Math. Model. Anal. 26(4): 684-695 (2021) - [i6]Joël Chaskalovic, Hessam Jamshidipour:
A New First Order Taylor-like Theorem With An Optimized Reduced Remainder. CoRR abs/2112.14162 (2021) - 2020
- [j9]Joël Chaskalovic, Franck Assous:
A New Probabilistic Interpretation of the Bramble-Hilbert Lemma. Comput. Methods Appl. Math. 20(1): 79-87 (2020) - [j8]Joël Chaskalovic, Franck Assous:
A New Mixed Functional-probabilistic Approach for Finite Element Accuracy. Comput. Methods Appl. Math. 20(4): 799-813 (2020) - [j7]Joël Chaskalovic, Franck Assous:
On generalized binomial laws to evaluate finite element accuracy: preliminary probabilistic results for adaptive mesh refinement. J. Num. Math. 28(2): 63-74 (2020) - [i5]Joël Chaskalovic:
A probabilistic approach for exact solutions of determinist PDE's as well as their finite element approximations. CoRR abs/2002.01781 (2020) - [i4]Joël Chaskalovic, Franck Assous:
Numerical validation of probabilistic laws to evaluate finite element error estimates. CoRR abs/2011.11294 (2020) - [i3]Joël Chaskalovic, Franck Assous:
Generalized Beta Prime Distribution Applied to Finite Element Error Approximation. CoRR abs/2011.11298 (2020)
2010 – 2019
- 2018
- [c2]Joël Chaskalovic, Franck Assous:
From a Geometrical Interpretation of Bramble-Hilbert Lemma to a Probability Distribution for Finite Element Accuracy. FDM 2018: 3-14 - 2017
- [j6]Joël Chaskalovic, Franck Assous:
Probabilistic Approach to characterize Quantitative uncertainty in numerical Approximations. Math. Model. Anal. 22(1): 106-120 (2017) - 2016
- [j5]Joël Chaskalovic, Franck Assous:
Data mining and probabilistic models for error estimate analysis of finite element method. Math. Comput. Simul. 129: 50-68 (2016) - 2015
- [i2]Stéphane Doncieux, Jean Liénard, Benoît Girard, Mohamed Hamdaoui, Joël Chaskalovic:
Multi-objective analysis of computational models. CoRR abs/1507.06877 (2015) - 2014
- [j4]Franck Assous, Joël Chaskalovic:
A paraxial asymptotic model for the coupled Vlasov-Maxwell problem in electromagnetics. J. Comput. Appl. Math. 270: 369-385 (2014) - [j3]Franck Assous, Joël Chaskalovic:
Indeterminate constants in numerical approximations of PDEs: A pilot study using data mining techniques. J. Comput. Appl. Math. 270: 462-470 (2014) - 2011
- [j2]Franck Assous, Joël Chaskalovic:
Data mining techniques for scientific computing: Application to asymptotic paraxial approximations to model ultrarelativistic particles. J. Comput. Phys. 230(12): 4811-4827 (2011) - [c1]Franck Assous, Joël Chaskalovic:
Data Mining Methods For Performance Evaluations To Asymptotic Numerical Models. ICCS 2011: 518-527 - 2010
- [j1]Joel Ratsaby, Joël Chaskalovic:
On the algorithmic complexity of static structures. J. Syst. Sci. Complex. 23(6): 1037-1053 (2010)
2000 – 2009
- 2008
- [i1]Joel Ratsaby, Joël Chaskalovic:
Algorithmic complexity and randomness in elastic solids. CoRR abs/0811.0623 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-15 20:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
