default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAbderrahman Bouhamidi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j25]Oumaima Benchettou
, Abdeslem Hafid Bentbib, Abderrahman Bouhamidi, Karim Kreit:
Constrained tensorial total variation problem based on an alternating conditional gradient algorithm. J. Comput. Appl. Math. 451: 116018 (2024)- [j24]Abderrahman Bouhamidi, Lakhdar Elbouyahyaoui, Mohammed Heyouni:
The constant solution method for solving large-scale differential Sylvester matrix equations with time invariant coefficients. Numer. Algorithms 96(1): 449-488 (2024) - [j23]Oumaima Benchettou, Abdeslem Hafid Bentbib, Abderrahman Bouhamidi:
Tensorial total variation-based image and video restoration with optimized projection methods. Optim. Methods Softw. 39(1): 102-133 (2024) - 2023
- [j22]Oumaima Benchettou, Abdeslem Hafid Bentbib, Abderrahman Bouhamidi:
An Accelerated Tensorial Double Proximal Gradient Method for Total Variation Regularization Problem. J. Optim. Theory Appl. 198(1): 111-134 (2023) - 2018
- [j21]Abderrahman Bouhamidi, Mohammed Bellalij, Rentsen Enkhbat, Khalide Jbilou, Marcos Raydan:
Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems. J. Optim. Theory Appl. 176(1): 163-177 (2018) - [j20]Mohamed Addam, Abderrahman Bouhamidi, Mohammed Heyouni:
On Solving an Acoustic Wave Problem Via Frequency-Domain Approach and Tensorial Spline Galerkin Method. J. Sci. Comput. 74(3): 1193-1220 (2018) - [j19]M. Shadi Mohamed, Mohammed Seaïd, Abderrahman Bouhamidi:
Iterative solvers for generalized finite element solution of boundary-value problems. Numer. Linear Algebra Appl. 25(6) (2018) - 2016
- [j18]Abderrahman Bouhamidi, Mustapha Hached, Khalide Jbilou:
A preconditioned block Arnoldi method for large scale Lyapunov and algebraic Riccati equations. J. Glob. Optim. 65(1): 19-32 (2016) - 2015
- [j17]Mohamed Addam, Abderrahman Bouhamidi, Mohammed Seaïd:
A Frequency-Domain Approach for the P1 Approximation of Time-Dependent Radiative Transfer. J. Sci. Comput. 62(3): 623-651 (2015) - 2014
- [j16]Abderrahman Bouhamidi, Mustapha Hached, Khalide Jbilou:
A meshless RBF method for computing a numerical solution of unsteady Burgers'-type equations. Comput. Math. Appl. 68(3): 238-256 (2014) - [j15]Abderrahman Bouhamidi, Rentsen Enkhbat, Khalide Jbilou:
Conditional gradient Tikhonov method for a convex optimization problem in image restoration. J. Comput. Appl. Math. 255: 580-592 (2014) - 2013
- [j14]Abderrahman Bouhamidi, Mustapha Hached, Mohammed Heyouni, Khalide Jbilou:
A preconditioned block Arnoldi method for large Sylvester matrix equations. Numer. Linear Algebra Appl. 20(2): 208-219 (2013) - 2012
- [j13]Abderrahman Bouhamidi, Khalide Jbilou, Ronny Ramlau, Lothar Reichel, Hassane Sadok, Fiorella Sgallari:
Inverse problems: Computation and applications. J. Comput. Appl. Math. 236(8): 2047-2048 (2012) - [j12]Abderrahman Bouhamidi, Khalide Jbilou, Lothar Reichel, Hassane Sadok:
A generalized global Arnoldi method for ill-posed matrix equations. J. Comput. Appl. Math. 236(8): 2078-2089 (2012) - [j11]Abderrahman Bouhamidi, Khalide Jbilou:
A Kronecker approximation with a convex constrained optimization method for blind image restoration. Optim. Lett. 6(7): 1251-1264 (2012) - 2011
- [j10]Abderrahman Bouhamidi, Khalide Jbilou, Marcos Raydan:
Convex constrained optimization for large-scale generalized Sylvester equations. Comput. Optim. Appl. 48(2): 233-253 (2011) - [j9]Abderrahman Bouhamidi, Mohammed Heyouni, Khalide Jbilou:
Block Arnoldi-based methods for large scale discrete-time algebraic Riccati equations. J. Comput. Appl. Math. 236(6): 1531-1542 (2011) - 2010
- [j8]Mohamed Addam, Abderrahman Bouhamidi, Khalide Jbilou:
A numerical method for one-dimensional diffusion problem using Fourier transform and the B-spline Galerkin method. Appl. Math. Comput. 215(12): 4067-4079 (2010) - [j7]Mohammed-Najib Benbourhim, Abderrahman Bouhamidi:
Meshless Pseudo-Polyharmonic Divergence-Free and Curl-Free Vector Fields Approximation. SIAM J. Math. Anal. 42(3): 1218-1245 (2010) - 2008
- [j6]Abderrahman Bouhamidi, Khalide Jbilou:
A note on the numerical approximate solutions for generalized Sylvester matrix equations with applications. Appl. Math. Comput. 206(2): 687-694 (2008) - [j5]Mohammed-Najib Benbourhim, Abderrahman Bouhamidi:
Error estimates for interpolating div-curl splines under tension on a bounded domain. J. Approx. Theory 152(1): 66-81 (2008) - [j4]Mohammed-Najib Benbourhim, Abderrahman Bouhamidi:
Pseudo-polyharmonic vectorial approximation for div-curl and elastic semi-norms. Numerische Mathematik 109(3): 333-364 (2008) - 2005
- [j3]Mohammed-Najib Benbourhim, Abderrahman Bouhamidi:
Approximation of vectors fields by thin plate splines with tension. J. Approx. Theory 136(2): 198-229 (2005) - 2004
- [j2]Abderrahman Bouhamidi, Alain Le Méhauté:
Radial basis functions under tension. J. Approx. Theory 127(2): 135-154 (2004) - 1999
- [j1]Abderrahman Bouhamidi, Alain Le Méhauté:
Multivariate interpolating (m, l, s)-splines. Adv. Comput. Math. 11(4): 287-314 (1999)
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-07 22:16 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:
